./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.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.09.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', '39b635cc2ab0f0d4f8e606a07f9fc2cea48a2218c52549f8b5aa54058d2e5b4b'] 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.09.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 39b635cc2ab0f0d4f8e606a07f9fc2cea48a2218c52549f8b5aa54058d2e5b4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:46:04,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:46:04,833 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:04,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:46:04,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:46:04,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:46:04,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:46:04,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:46:04,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:46:04,870 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:46:04,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:46:04,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:46:04,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:46:04,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:46:04,871 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:46:04,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:46:04,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:46:04,872 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:46:04,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:46:04,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:46:04,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:46:04,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:46:04,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:46:04,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:46:04,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:46:04,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:46:04,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:46:04,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:46:04,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:46:04,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:46:04,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:46:04,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:46:04,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:46:04,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:46:04,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:46:04,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:46:04,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:46:04,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:46:04,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:46:04,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:46:04,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:46:04,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:46:04,875 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 -> 39b635cc2ab0f0d4f8e606a07f9fc2cea48a2218c52549f8b5aa54058d2e5b4b [2024-11-07 01:46:05,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:46:05,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:46:05,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:46:05,164 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:46:05,164 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:46:05,165 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.09.cil-2.c [2024-11-07 01:46:06,517 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:46:06,777 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:46:06,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-2.c [2024-11-07 01:46:06,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9aab9c47e/99cf3d25e5cd4c06a0924adc6e5cd249/FLAGe91c9e333 [2024-11-07 01:46:06,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9aab9c47e/99cf3d25e5cd4c06a0924adc6e5cd249 [2024-11-07 01:46:06,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:46:06,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:46:06,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:46:06,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:46:06,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:46:06,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:46:06" (1/1) ... [2024-11-07 01:46:06,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eba4f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:06, skipping insertion in model container [2024-11-07 01:46:06,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:46:06" (1/1) ... [2024-11-07 01:46:06,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:46:07,035 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.09.cil-2.c[914,927] [2024-11-07 01:46:07,098 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.09.cil-2.c[7115,7128] [2024-11-07 01:46:07,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:46:07,200 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:46:07,214 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.09.cil-2.c[914,927] [2024-11-07 01:46:07,231 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.09.cil-2.c[7115,7128] [2024-11-07 01:46:07,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:46:07,319 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:46:07,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:07 WrapperNode [2024-11-07 01:46:07,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:46:07,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:46:07,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:46:07,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:46:07,326 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:07" (1/1) ... [2024-11-07 01:46:07,342 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:07" (1/1) ... [2024-11-07 01:46:07,392 INFO L138 Inliner]: procedures = 71, calls = 85, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 894 [2024-11-07 01:46:07,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:46:07,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:46:07,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:46:07,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:46:07,402 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:07" (1/1) ... [2024-11-07 01:46:07,403 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:07" (1/1) ... [2024-11-07 01:46:07,413 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:07" (1/1) ... [2024-11-07 01:46:07,442 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:07,442 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:07" (1/1) ... [2024-11-07 01:46:07,442 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:07" (1/1) ... [2024-11-07 01:46:07,464 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:07" (1/1) ... [2024-11-07 01:46:07,486 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:07" (1/1) ... [2024-11-07 01:46:07,492 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:07" (1/1) ... [2024-11-07 01:46:07,497 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:07" (1/1) ... [2024-11-07 01:46:07,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:46:07,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:46:07,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:46:07,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:46:07,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:07" (1/1) ... [2024-11-07 01:46:07,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:46:07,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:46:07,538 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:07,542 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:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:46:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:46:07,565 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:46:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-07 01:46:07,565 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-07 01:46:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:46:07,565 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:46:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:46:07,566 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:46:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-07 01:46:07,566 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-07 01:46:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:46:07,566 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:46:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:46:07,566 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:46:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-07 01:46:07,566 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-07 01:46:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-07 01:46:07,567 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-07 01:46:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-07 01:46:07,567 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-07 01:46:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:46:07,568 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:46:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:46:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:46:07,568 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:46:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-07 01:46:07,569 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-07 01:46:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:46:07,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:46:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:46:07,569 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:46:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-07 01:46:07,570 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-07 01:46:07,723 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:46:07,726 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:46:08,615 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-07 01:46:08,616 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:46:08,639 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:46:08,643 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-07 01:46:08,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:46:08 BoogieIcfgContainer [2024-11-07 01:46:08,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:46:08,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:46:08,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:46:08,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:46:08,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:46:06" (1/3) ... [2024-11-07 01:46:08,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1158c93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:46:08, skipping insertion in model container [2024-11-07 01:46:08,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:07" (2/3) ... [2024-11-07 01:46:08,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1158c93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:46:08, skipping insertion in model container [2024-11-07 01:46:08,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:46:08" (3/3) ... [2024-11-07 01:46:08,653 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.09.cil-2.c [2024-11-07 01:46:08,667 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:46:08,667 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:46:08,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:46:08,751 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;@273eb22f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:46:08,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:46:08,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 426 states, 369 states have (on average 1.6151761517615175) internal successors, (596), 377 states have internal predecessors, (596), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 01:46:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:46:08,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:08,775 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:08,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:08,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash -661048857, now seen corresponding path program 1 times [2024-11-07 01:46:08,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:08,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971673169] [2024-11-07 01:46:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:08,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:09,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:09,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:09,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:09,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:09,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:09,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:09,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:09,325 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:09,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971673169] [2024-11-07 01:46:09,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971673169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:09,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:09,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:46:09,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961765173] [2024-11-07 01:46:09,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:09,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:46:09,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:09,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:46:09,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:46:09,356 INFO L87 Difference]: Start difference. First operand has 426 states, 369 states have (on average 1.6151761517615175) internal successors, (596), 377 states have internal predecessors, (596), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 37 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:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:10,758 INFO L93 Difference]: Finished difference Result 961 states and 1512 transitions. [2024-11-07 01:46:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:46:10,761 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:10,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:10,776 INFO L225 Difference]: With dead ends: 961 [2024-11-07 01:46:10,776 INFO L226 Difference]: Without dead ends: 550 [2024-11-07 01:46:10,786 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:10,789 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 748 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:10,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1889 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:46:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-07 01:46:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 511. [2024-11-07 01:46:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 437 states have (on average 1.5034324942791761) internal successors, (657), 444 states have internal predecessors, (657), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2024-11-07 01:46:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 758 transitions. [2024-11-07 01:46:10,897 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 758 transitions. Word has length 65 [2024-11-07 01:46:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:10,897 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 758 transitions. [2024-11-07 01:46:10,898 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:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 758 transitions. [2024-11-07 01:46:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:46:10,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:10,904 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:10,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:46:10,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:10,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:10,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1017839783, now seen corresponding path program 1 times [2024-11-07 01:46:10,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:10,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348074458] [2024-11-07 01:46:10,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:10,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:11,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:11,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:11,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:11,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:11,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:11,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:11,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:11,184 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:11,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:11,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348074458] [2024-11-07 01:46:11,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348074458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:11,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:11,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:46:11,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998189738] [2024-11-07 01:46:11,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:11,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:46:11,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:11,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:46:11,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:46:11,189 INFO L87 Difference]: Start difference. First operand 511 states and 758 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:12,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:12,557 INFO L93 Difference]: Finished difference Result 858 states and 1235 transitions. [2024-11-07 01:46:12,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:46:12,559 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:12,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:12,567 INFO L225 Difference]: With dead ends: 858 [2024-11-07 01:46:12,570 INFO L226 Difference]: Without dead ends: 681 [2024-11-07 01:46:12,571 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:12,572 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 1190 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:12,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 2120 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:46:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-07 01:46:12,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 607. [2024-11-07 01:46:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 513 states have (on average 1.4834307992202729) internal successors, (761), 522 states have internal predecessors, (761), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2024-11-07 01:46:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 892 transitions. [2024-11-07 01:46:12,636 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 892 transitions. Word has length 65 [2024-11-07 01:46:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:12,636 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 892 transitions. [2024-11-07 01:46:12,637 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:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 892 transitions. [2024-11-07 01:46:12,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:46:12,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:12,639 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:12,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:46:12,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:12,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:12,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1010746327, now seen corresponding path program 1 times [2024-11-07 01:46:12,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:12,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219176755] [2024-11-07 01:46:12,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:12,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:12,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:12,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:12,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:12,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:12,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:12,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:12,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:12,839 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:12,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:12,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219176755] [2024-11-07 01:46:12,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219176755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:12,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:12,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:46:12,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052704299] [2024-11-07 01:46:12,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:12,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:46:12,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:12,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:46:12,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:46:12,844 INFO L87 Difference]: Start difference. First operand 607 states and 892 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:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:13,987 INFO L93 Difference]: Finished difference Result 906 states and 1303 transitions. [2024-11-07 01:46:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:46:13,989 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:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:13,994 INFO L225 Difference]: With dead ends: 906 [2024-11-07 01:46:13,994 INFO L226 Difference]: Without dead ends: 639 [2024-11-07 01:46:13,996 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:13,997 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 530 mSDsluCounter, 2169 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:13,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 2534 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:46:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-07 01:46:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 612. [2024-11-07 01:46:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 517 states have (on average 1.4758220502901354) internal successors, (763), 526 states have internal predecessors, (763), 61 states have call successors, (61), 29 states have call predecessors, (61), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2024-11-07 01:46:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 895 transitions. [2024-11-07 01:46:14,054 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 895 transitions. Word has length 65 [2024-11-07 01:46:14,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:14,054 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 895 transitions. [2024-11-07 01:46:14,054 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:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 895 transitions. [2024-11-07 01:46:14,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:46:14,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:14,059 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:14,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:46:14,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:14,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:14,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2040105625, now seen corresponding path program 1 times [2024-11-07 01:46:14,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:14,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253395060] [2024-11-07 01:46:14,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:14,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:14,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:14,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:14,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:14,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:14,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:14,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:14,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:14,229 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:14,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:14,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253395060] [2024-11-07 01:46:14,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253395060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:14,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:14,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:46:14,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85267420] [2024-11-07 01:46:14,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:14,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:46:14,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:14,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:46:14,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:46:14,231 INFO L87 Difference]: Start difference. First operand 612 states and 895 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:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:15,278 INFO L93 Difference]: Finished difference Result 928 states and 1325 transitions. [2024-11-07 01:46:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:46:15,278 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:15,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:15,288 INFO L225 Difference]: With dead ends: 928 [2024-11-07 01:46:15,288 INFO L226 Difference]: Without dead ends: 656 [2024-11-07 01:46:15,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:46:15,290 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 795 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:15,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2245 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:46:15,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-11-07 01:46:15,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 627. [2024-11-07 01:46:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 529 states have (on average 1.4650283553875236) internal successors, (775), 538 states have internal predecessors, (775), 61 states have call successors, (61), 29 states have call predecessors, (61), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) [2024-11-07 01:46:15,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 910 transitions. [2024-11-07 01:46:15,355 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 910 transitions. Word has length 65 [2024-11-07 01:46:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:15,355 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 910 transitions. [2024-11-07 01:46:15,356 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:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 910 transitions. [2024-11-07 01:46:15,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:46:15,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:15,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] [2024-11-07 01:46:15,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:46:15,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:15,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:15,358 INFO L85 PathProgramCache]: Analyzing trace with hash -653902231, now seen corresponding path program 1 times [2024-11-07 01:46:15,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:15,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119786753] [2024-11-07 01:46:15,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:15,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:15,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:15,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:15,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:15,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:15,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:15,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:15,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:15,573 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:15,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:15,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119786753] [2024-11-07 01:46:15,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119786753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:15,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:15,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:46:15,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478320784] [2024-11-07 01:46:15,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:15,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:46:15,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:15,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:46:15,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:46:15,576 INFO L87 Difference]: Start difference. First operand 627 states and 910 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:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:16,735 INFO L93 Difference]: Finished difference Result 1019 states and 1421 transitions. [2024-11-07 01:46:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:46:16,735 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:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:16,739 INFO L225 Difference]: With dead ends: 1019 [2024-11-07 01:46:16,739 INFO L226 Difference]: Without dead ends: 734 [2024-11-07 01:46:16,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:46:16,741 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 1502 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:16,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1528 Valid, 1601 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:46:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-11-07 01:46:16,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 639. [2024-11-07 01:46:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 539 states have (on average 1.4564007421150278) internal successors, (785), 548 states have internal predecessors, (785), 62 states have call successors, (62), 30 states have call predecessors, (62), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) [2024-11-07 01:46:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 920 transitions. [2024-11-07 01:46:16,782 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 920 transitions. Word has length 65 [2024-11-07 01:46:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:16,782 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 920 transitions. [2024-11-07 01:46:16,782 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:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 920 transitions. [2024-11-07 01:46:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:46:16,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:16,785 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,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:46:16,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:16,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:16,786 INFO L85 PathProgramCache]: Analyzing trace with hash -787915737, now seen corresponding path program 1 times [2024-11-07 01:46:16,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:16,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566816211] [2024-11-07 01:46:16,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:16,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,923 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:16,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:16,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566816211] [2024-11-07 01:46:16,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566816211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:16,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:16,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:16,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981329631] [2024-11-07 01:46:16,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:16,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:16,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:16,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:16,925 INFO L87 Difference]: Start difference. First operand 639 states and 920 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:17,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:17,702 INFO L93 Difference]: Finished difference Result 1281 states and 1767 transitions. [2024-11-07 01:46:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:46:17,702 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:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:17,709 INFO L225 Difference]: With dead ends: 1281 [2024-11-07 01:46:17,709 INFO L226 Difference]: Without dead ends: 985 [2024-11-07 01:46:17,710 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:17,711 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 1190 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:17,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 1541 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:46:17,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-11-07 01:46:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 929. [2024-11-07 01:46:17,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 763 states have (on average 1.4049803407601573) internal successors, (1072), 779 states have internal predecessors, (1072), 97 states have call successors, (97), 52 states have call predecessors, (97), 67 states have return successors, (130), 104 states have call predecessors, (130), 93 states have call successors, (130) [2024-11-07 01:46:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1299 transitions. [2024-11-07 01:46:17,783 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1299 transitions. Word has length 65 [2024-11-07 01:46:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:17,783 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1299 transitions. [2024-11-07 01:46:17,785 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:17,785 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1299 transitions. [2024-11-07 01:46:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:46:17,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:17,791 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:17,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:46:17,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:17,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:17,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2027130796, now seen corresponding path program 1 times [2024-11-07 01:46:17,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:17,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419373827] [2024-11-07 01:46:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:17,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:17,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:17,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:17,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:17,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:17,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:17,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:17,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:17,879 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,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:17,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419373827] [2024-11-07 01:46:17,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419373827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:17,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:17,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:46:17,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744662369] [2024-11-07 01:46:17,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:17,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:46:17,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:17,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:46:17,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:46:17,881 INFO L87 Difference]: Start difference. First operand 929 states and 1299 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:18,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:18,674 INFO L93 Difference]: Finished difference Result 2132 states and 2870 transitions. [2024-11-07 01:46:18,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:46:18,675 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:18,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:18,682 INFO L225 Difference]: With dead ends: 2132 [2024-11-07 01:46:18,682 INFO L226 Difference]: Without dead ends: 1525 [2024-11-07 01:46:18,684 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:18,684 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 723 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:18,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1514 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:46:18,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2024-11-07 01:46:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1410. [2024-11-07 01:46:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1142 states have (on average 1.3598949211908933) internal successors, (1553), 1161 states have internal predecessors, (1553), 142 states have call successors, (142), 96 states have call predecessors, (142), 124 states have return successors, (202), 159 states have call predecessors, (202), 138 states have call successors, (202) [2024-11-07 01:46:18,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 1897 transitions. [2024-11-07 01:46:18,786 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 1897 transitions. Word has length 66 [2024-11-07 01:46:18,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:18,786 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 1897 transitions. [2024-11-07 01:46:18,787 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:18,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1897 transitions. [2024-11-07 01:46:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:46:18,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:18,789 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:18,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:46:18,789 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:18,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:18,790 INFO L85 PathProgramCache]: Analyzing trace with hash -809596841, now seen corresponding path program 1 times [2024-11-07 01:46:18,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:18,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147808891] [2024-11-07 01:46:18,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:18,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:18,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:18,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:18,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:18,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:18,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:18,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:18,854 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:18,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:18,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147808891] [2024-11-07 01:46:18,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147808891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:18,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:18,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:46:18,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928555186] [2024-11-07 01:46:18,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:18,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:46:18,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:18,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:46:18,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:46:18,855 INFO L87 Difference]: Start difference. First operand 1410 states and 1897 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:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:19,522 INFO L93 Difference]: Finished difference Result 3598 states and 4703 transitions. [2024-11-07 01:46:19,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:46:19,523 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:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:19,535 INFO L225 Difference]: With dead ends: 3598 [2024-11-07 01:46:19,535 INFO L226 Difference]: Without dead ends: 2530 [2024-11-07 01:46:19,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:46:19,539 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 1194 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:19,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 1264 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:46:19,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2024-11-07 01:46:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2272. [2024-11-07 01:46:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 1808 states have (on average 1.3163716814159292) internal successors, (2380), 1837 states have internal predecessors, (2380), 240 states have call successors, (240), 180 states have call predecessors, (240), 222 states have return successors, (338), 261 states have call predecessors, (338), 236 states have call successors, (338) [2024-11-07 01:46:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2958 transitions. [2024-11-07 01:46:19,724 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2958 transitions. Word has length 66 [2024-11-07 01:46:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:19,725 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 2958 transitions. [2024-11-07 01:46:19,725 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:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2958 transitions. [2024-11-07 01:46:19,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 01:46:19,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:19,727 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] [2024-11-07 01:46:19,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:46:19,728 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:19,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:19,728 INFO L85 PathProgramCache]: Analyzing trace with hash 165518731, now seen corresponding path program 1 times [2024-11-07 01:46:19,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:19,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533212537] [2024-11-07 01:46:19,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:19,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,810 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,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:19,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533212537] [2024-11-07 01:46:19,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533212537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:19,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:19,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:46:19,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334448643] [2024-11-07 01:46:19,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:19,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:46:19,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:19,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:46:19,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:46:19,812 INFO L87 Difference]: Start difference. First operand 2272 states and 2958 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:20,609 INFO L93 Difference]: Finished difference Result 5182 states and 6608 transitions. [2024-11-07 01:46:20,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:46:20,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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 72 [2024-11-07 01:46:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:20,624 INFO L225 Difference]: With dead ends: 5182 [2024-11-07 01:46:20,624 INFO L226 Difference]: Without dead ends: 3252 [2024-11-07 01:46:20,628 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:20,629 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 1473 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:20,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1013 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:46:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2024-11-07 01:46:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 3004. [2024-11-07 01:46:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 2376 states have (on average 1.297979797979798) internal successors, (3084), 2413 states have internal predecessors, (3084), 320 states have call successors, (320), 250 states have call predecessors, (320), 306 states have return successors, (447), 347 states have call predecessors, (447), 316 states have call successors, (447) [2024-11-07 01:46:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 3851 transitions. [2024-11-07 01:46:20,892 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 3851 transitions. Word has length 72 [2024-11-07 01:46:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:20,893 INFO L471 AbstractCegarLoop]: Abstraction has 3004 states and 3851 transitions. [2024-11-07 01:46:20,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 3851 transitions. [2024-11-07 01:46:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 01:46:20,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:20,896 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:20,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:46:20,896 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:20,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:20,897 INFO L85 PathProgramCache]: Analyzing trace with hash 319366341, now seen corresponding path program 1 times [2024-11-07 01:46:20,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:20,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596980070] [2024-11-07 01:46:20,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:20,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:20,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:20,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:20,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,014 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:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596980070] [2024-11-07 01:46:21,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596980070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:21,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:21,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:21,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518296954] [2024-11-07 01:46:21,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:21,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:21,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:21,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:21,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:21,017 INFO L87 Difference]: Start difference. First operand 3004 states and 3851 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:21,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:21,875 INFO L93 Difference]: Finished difference Result 3778 states and 4782 transitions. [2024-11-07 01:46:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:46:21,876 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:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:21,889 INFO L225 Difference]: With dead ends: 3778 [2024-11-07 01:46:21,889 INFO L226 Difference]: Without dead ends: 3775 [2024-11-07 01:46:21,890 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:21,891 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 1793 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1803 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:21,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1803 Valid, 1284 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:46:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3775 states. [2024-11-07 01:46:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3775 to 3498. [2024-11-07 01:46:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 2761 states have (on average 1.2879391524809851) internal successors, (3556), 2803 states have internal predecessors, (3556), 370 states have call successors, (370), 294 states have call predecessors, (370), 365 states have return successors, (526), 407 states have call predecessors, (526), 367 states have call successors, (526) [2024-11-07 01:46:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 4452 transitions. [2024-11-07 01:46:22,151 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 4452 transitions. Word has length 73 [2024-11-07 01:46:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:22,151 INFO L471 AbstractCegarLoop]: Abstraction has 3498 states and 4452 transitions. [2024-11-07 01:46:22,151 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:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 4452 transitions. [2024-11-07 01:46:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 01:46:22,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:22,153 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:22,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:46:22,154 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:22,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:22,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1309170965, now seen corresponding path program 1 times [2024-11-07 01:46:22,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:22,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32827109] [2024-11-07 01:46:22,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:22,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,324 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:22,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32827109] [2024-11-07 01:46:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32827109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:46:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030162047] [2024-11-07 01:46:22,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:22,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:46:22,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:46:22,327 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:22,330 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:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 01:46:22,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:46:22,714 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:22,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:46:22,815 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:22,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030162047] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:46:22,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:46:22,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-07 01:46:22,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805274851] [2024-11-07 01:46:22,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:46:22,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:46:22,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:22,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:46:22,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:46:22,817 INFO L87 Difference]: Start difference. First operand 3498 states and 4452 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:24,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:24,745 INFO L93 Difference]: Finished difference Result 7939 states and 9938 transitions. [2024-11-07 01:46:24,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 01:46:24,746 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:24,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:24,776 INFO L225 Difference]: With dead ends: 7939 [2024-11-07 01:46:24,776 INFO L226 Difference]: Without dead ends: 7936 [2024-11-07 01:46:24,780 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:24,781 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 1718 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 1788 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1787 SdHoareTripleChecker+Valid, 2312 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:24,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1787 Valid, 2312 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1788 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:46:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7936 states. [2024-11-07 01:46:25,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7936 to 5288. [2024-11-07 01:46:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5288 states, 4165 states have (on average 1.2801920768307322) internal successors, (5332), 4229 states have internal predecessors, (5332), 554 states have call successors, (554), 452 states have call predecessors, (554), 567 states have return successors, (804), 613 states have call predecessors, (804), 551 states have call successors, (804) [2024-11-07 01:46:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5288 states to 5288 states and 6690 transitions. [2024-11-07 01:46:25,248 INFO L78 Accepts]: Start accepts. Automaton has 5288 states and 6690 transitions. Word has length 74 [2024-11-07 01:46:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:25,248 INFO L471 AbstractCegarLoop]: Abstraction has 5288 states and 6690 transitions. [2024-11-07 01:46:25,249 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:25,249 INFO L276 IsEmpty]: Start isEmpty. Operand 5288 states and 6690 transitions. [2024-11-07 01:46:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 01:46:25,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:25,252 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:25,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 01:46:25,456 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,SelfDestructingSolverStorable10 [2024-11-07 01:46:25,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:25,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:25,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1768616773, now seen corresponding path program 2 times [2024-11-07 01:46:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:25,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501979987] [2024-11-07 01:46:25,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:25,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,559 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:25,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:25,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501979987] [2024-11-07 01:46:25,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501979987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:25,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:25,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:46:25,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695975867] [2024-11-07 01:46:25,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:25,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:46:25,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:25,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:46:25,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:46:25,561 INFO L87 Difference]: Start difference. First operand 5288 states and 6690 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:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:26,566 INFO L93 Difference]: Finished difference Result 7970 states and 10063 transitions. [2024-11-07 01:46:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:46:26,566 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:26,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:26,583 INFO L225 Difference]: With dead ends: 7970 [2024-11-07 01:46:26,584 INFO L226 Difference]: Without dead ends: 3895 [2024-11-07 01:46:26,592 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:26,593 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1099 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:26,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 1396 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:46:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2024-11-07 01:46:26,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3660. [2024-11-07 01:46:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3660 states, 2893 states have (on average 1.2692706533010716) internal successors, (3672), 2935 states have internal predecessors, (3672), 386 states have call successors, (386), 308 states have call predecessors, (386), 379 states have return successors, (530), 423 states have call predecessors, (530), 383 states have call successors, (530) [2024-11-07 01:46:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 4588 transitions. [2024-11-07 01:46:26,949 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 4588 transitions. Word has length 77 [2024-11-07 01:46:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:26,949 INFO L471 AbstractCegarLoop]: Abstraction has 3660 states and 4588 transitions. [2024-11-07 01:46:26,949 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:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 4588 transitions. [2024-11-07 01:46:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 01:46:26,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:26,952 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:26,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:46:26,952 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:26,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:26,953 INFO L85 PathProgramCache]: Analyzing trace with hash 651365895, now seen corresponding path program 1 times [2024-11-07 01:46:26,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:26,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903296740] [2024-11-07 01:46:26,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:26,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:27,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:27,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:27,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:27,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:27,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:27,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:27,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 01:46:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:27,065 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:27,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:27,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903296740] [2024-11-07 01:46:27,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903296740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:27,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:27,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:46:27,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67747476] [2024-11-07 01:46:27,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:27,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:46:27,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:27,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:46:27,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:46:27,068 INFO L87 Difference]: Start difference. First operand 3660 states and 4588 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:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:28,578 INFO L93 Difference]: Finished difference Result 10532 states and 13005 transitions. [2024-11-07 01:46:28,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 01:46:28,579 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:28,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:28,600 INFO L225 Difference]: With dead ends: 10532 [2024-11-07 01:46:28,600 INFO L226 Difference]: Without dead ends: 5895 [2024-11-07 01:46:28,609 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:28,610 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 1257 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:28,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 1653 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:46:28,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5895 states. [2024-11-07 01:46:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5895 to 5575. [2024-11-07 01:46:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5575 states, 4351 states have (on average 1.2399448402666053) internal successors, (5395), 4436 states have internal predecessors, (5395), 590 states have call successors, (590), 482 states have call predecessors, (590), 632 states have return successors, (912), 663 states have call predecessors, (912), 587 states have call successors, (912) [2024-11-07 01:46:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 6897 transitions. [2024-11-07 01:46:29,078 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 6897 transitions. Word has length 84 [2024-11-07 01:46:29,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:29,078 INFO L471 AbstractCegarLoop]: Abstraction has 5575 states and 6897 transitions. [2024-11-07 01:46:29,079 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:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 6897 transitions. [2024-11-07 01:46:29,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 01:46:29,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:29,083 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:29,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:46:29,084 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:29,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash 940680323, now seen corresponding path program 1 times [2024-11-07 01:46:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:29,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144403410] [2024-11-07 01:46:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:46:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,215 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:29,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:29,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144403410] [2024-11-07 01:46:29,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144403410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:29,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:29,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:46:29,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854361714] [2024-11-07 01:46:29,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:29,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:46:29,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:29,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:46:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:46:29,219 INFO L87 Difference]: Start difference. First operand 5575 states and 6897 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:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:30,762 INFO L93 Difference]: Finished difference Result 9578 states and 11737 transitions. [2024-11-07 01:46:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 01:46:30,763 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:30,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:30,782 INFO L225 Difference]: With dead ends: 9578 [2024-11-07 01:46:30,782 INFO L226 Difference]: Without dead ends: 4985 [2024-11-07 01:46:30,789 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:30,790 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 1792 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1835 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:30,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1835 Valid, 1992 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:46:30,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4985 states. [2024-11-07 01:46:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4985 to 4651. [2024-11-07 01:46:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4651 states, 3640 states have (on average 1.2346153846153847) internal successors, (4494), 3707 states have internal predecessors, (4494), 491 states have call successors, (491), 397 states have call predecessors, (491), 518 states have return successors, (690), 553 states have call predecessors, (690), 488 states have call successors, (690) [2024-11-07 01:46:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4651 states to 4651 states and 5675 transitions. [2024-11-07 01:46:31,210 INFO L78 Accepts]: Start accepts. Automaton has 4651 states and 5675 transitions. Word has length 93 [2024-11-07 01:46:31,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:31,211 INFO L471 AbstractCegarLoop]: Abstraction has 4651 states and 5675 transitions. [2024-11-07 01:46:31,211 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:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 4651 states and 5675 transitions. [2024-11-07 01:46:31,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 01:46:31,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:31,219 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:31,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:46:31,219 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:31,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash 663499349, now seen corresponding path program 1 times [2024-11-07 01:46:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:31,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324268853] [2024-11-07 01:46:31,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:31,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 01:46:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 01:46:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:46:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 01:46:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:46:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 01:46:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 01:46:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,406 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:31,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:31,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324268853] [2024-11-07 01:46:31,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324268853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:46:31,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963650880] [2024-11-07 01:46:31,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:31,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:46:31,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:46:31,409 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:31,411 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:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 01:46:31,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:46:31,600 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:31,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:46:31,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963650880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:31,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:46:31,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-07 01:46:31,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402258298] [2024-11-07 01:46:31,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:31,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:46:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:31,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:46:31,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:46:31,608 INFO L87 Difference]: Start difference. First operand 4651 states and 5675 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:31,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:31,817 INFO L93 Difference]: Finished difference Result 6692 states and 8122 transitions. [2024-11-07 01:46:31,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:46:31,817 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:31,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:31,833 INFO L225 Difference]: With dead ends: 6692 [2024-11-07 01:46:31,834 INFO L226 Difference]: Without dead ends: 2387 [2024-11-07 01:46:31,846 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:31,846 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 0 mSDsluCounter, 2471 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3091 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:31,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3091 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:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2024-11-07 01:46:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 2387. [2024-11-07 01:46:32,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2387 states, 1953 states have (on average 1.2493599590373783) internal successors, (2440), 1969 states have internal predecessors, (2440), 215 states have call successors, (215), 163 states have call predecessors, (215), 217 states have return successors, (297), 255 states have call predecessors, (297), 212 states have call successors, (297) [2024-11-07 01:46:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2387 states and 2952 transitions. [2024-11-07 01:46:32,017 INFO L78 Accepts]: Start accepts. Automaton has 2387 states and 2952 transitions. Word has length 145 [2024-11-07 01:46:32,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:32,018 INFO L471 AbstractCegarLoop]: Abstraction has 2387 states and 2952 transitions. [2024-11-07 01:46:32,018 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:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 2952 transitions. [2024-11-07 01:46:32,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 01:46:32,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:32,024 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:32,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 01:46:32,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 01:46:32,225 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:32,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:32,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1655801647, now seen corresponding path program 1 times [2024-11-07 01:46:32,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:32,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136367924] [2024-11-07 01:46:32,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:32,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 01:46:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 01:46:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 01:46:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 01:46:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 01:46:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 01:46:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 01:46:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,321 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:32,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:32,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136367924] [2024-11-07 01:46:32,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136367924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:32,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:32,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:46:32,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136877434] [2024-11-07 01:46:32,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:32,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:46:32,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:32,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:46:32,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:46:32,323 INFO L87 Difference]: Start difference. First operand 2387 states and 2952 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:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:33,036 INFO L93 Difference]: Finished difference Result 2452 states and 3020 transitions. [2024-11-07 01:46:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:46:33,037 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:33,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:33,046 INFO L225 Difference]: With dead ends: 2452 [2024-11-07 01:46:33,046 INFO L226 Difference]: Without dead ends: 2009 [2024-11-07 01:46:33,048 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:33,048 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 892 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:33,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 1180 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:46:33,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2024-11-07 01:46:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1947. [2024-11-07 01:46:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1947 states, 1609 states have (on average 1.2653822249844624) internal successors, (2036), 1622 states have internal predecessors, (2036), 169 states have call successors, (169), 123 states have call predecessors, (169), 167 states have return successors, (233), 202 states have call predecessors, (233), 166 states have call successors, (233) [2024-11-07 01:46:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2438 transitions. [2024-11-07 01:46:33,213 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2438 transitions. Word has length 147 [2024-11-07 01:46:33,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:33,213 INFO L471 AbstractCegarLoop]: Abstraction has 1947 states and 2438 transitions. [2024-11-07 01:46:33,214 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:33,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2438 transitions. [2024-11-07 01:46:33,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:46:33,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:33,218 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] [2024-11-07 01:46:33,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:46:33,218 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:33,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:33,218 INFO L85 PathProgramCache]: Analyzing trace with hash -848431324, now seen corresponding path program 1 times [2024-11-07 01:46:33,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:33,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096443617] [2024-11-07 01:46:33,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:33,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:33,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:33,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:46:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:33,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:46:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:33,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:46:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:33,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:46:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:33,359 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:33,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:33,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096443617] [2024-11-07 01:46:33,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096443617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:33,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:33,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:46:33,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290256956] [2024-11-07 01:46:33,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:33,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:46:33,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:33,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:46:33,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:46:33,363 INFO L87 Difference]: Start difference. First operand 1947 states and 2438 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:34,779 INFO L93 Difference]: Finished difference Result 2367 states and 3108 transitions. [2024-11-07 01:46:34,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:46:34,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-07 01:46:34,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:34,787 INFO L225 Difference]: With dead ends: 2367 [2024-11-07 01:46:34,787 INFO L226 Difference]: Without dead ends: 2056 [2024-11-07 01:46:34,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:46:34,789 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 933 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:34,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 887 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:46:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2024-11-07 01:46:35,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 1947. [2024-11-07 01:46:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1947 states, 1609 states have (on average 1.264760720944686) internal successors, (2035), 1622 states have internal predecessors, (2035), 169 states have call successors, (169), 123 states have call predecessors, (169), 167 states have return successors, (233), 202 states have call predecessors, (233), 166 states have call successors, (233) [2024-11-07 01:46:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2437 transitions. [2024-11-07 01:46:35,148 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2437 transitions. Word has length 146 [2024-11-07 01:46:35,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:35,148 INFO L471 AbstractCegarLoop]: Abstraction has 1947 states and 2437 transitions. [2024-11-07 01:46:35,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2437 transitions. [2024-11-07 01:46:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:46:35,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:35,153 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] [2024-11-07 01:46:35,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:46:35,154 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:35,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:35,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1266320026, now seen corresponding path program 1 times [2024-11-07 01:46:35,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:35,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59955808] [2024-11-07 01:46:35,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:35,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:35,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:35,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:46:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:46:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:35,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:46:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:35,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:46:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:35,331 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:35,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:35,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59955808] [2024-11-07 01:46:35,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59955808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:35,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:35,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:46:35,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828364689] [2024-11-07 01:46:35,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:35,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:46:35,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:35,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:46:35,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:46:35,333 INFO L87 Difference]: Start difference. First operand 1947 states and 2437 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:37,488 INFO L93 Difference]: Finished difference Result 2781 states and 3768 transitions. [2024-11-07 01:46:37,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:46:37,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-07 01:46:37,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:37,498 INFO L225 Difference]: With dead ends: 2781 [2024-11-07 01:46:37,498 INFO L226 Difference]: Without dead ends: 2479 [2024-11-07 01:46:37,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:46:37,500 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 1457 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:37,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1326 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:46:37,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2024-11-07 01:46:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2260. [2024-11-07 01:46:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 1897 states have (on average 1.3115445440168687) internal successors, (2488), 1911 states have internal predecessors, (2488), 187 states have call successors, (187), 129 states have call predecessors, (187), 174 states have return successors, (254), 220 states have call predecessors, (254), 184 states have call successors, (254) [2024-11-07 01:46:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 2929 transitions. [2024-11-07 01:46:37,794 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 2929 transitions. Word has length 146 [2024-11-07 01:46:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:37,794 INFO L471 AbstractCegarLoop]: Abstraction has 2260 states and 2929 transitions. [2024-11-07 01:46:37,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 2929 transitions. [2024-11-07 01:46:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:46:37,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:37,799 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] [2024-11-07 01:46:37,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:46:37,799 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:37,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:37,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1227181666, now seen corresponding path program 1 times [2024-11-07 01:46:37,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:37,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867459263] [2024-11-07 01:46:37,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:37,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:46:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:46:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:46:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:46:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,997 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:37,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:37,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867459263] [2024-11-07 01:46:37,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867459263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:37,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:37,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538026151] [2024-11-07 01:46:37,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:37,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:37,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:37,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:37,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:37,999 INFO L87 Difference]: Start difference. First operand 2260 states and 2929 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:40,801 INFO L93 Difference]: Finished difference Result 3529 states and 4955 transitions. [2024-11-07 01:46:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:46:40,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-07 01:46:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:40,813 INFO L225 Difference]: With dead ends: 3529 [2024-11-07 01:46:40,813 INFO L226 Difference]: Without dead ends: 2914 [2024-11-07 01:46:40,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:46:40,816 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 1478 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 3046 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 3139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 3046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:40,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 2417 Invalid, 3139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 3046 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 01:46:40,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2024-11-07 01:46:41,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 2552. [2024-11-07 01:46:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2164 states have (on average 1.3396487985212568) internal successors, (2899), 2179 states have internal predecessors, (2899), 205 states have call successors, (205), 135 states have call predecessors, (205), 181 states have return successors, (274), 239 states have call predecessors, (274), 202 states have call successors, (274) [2024-11-07 01:46:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3378 transitions. [2024-11-07 01:46:41,111 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3378 transitions. Word has length 146 [2024-11-07 01:46:41,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:41,111 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3378 transitions. [2024-11-07 01:46:41,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3378 transitions. [2024-11-07 01:46:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:46:41,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:41,116 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] [2024-11-07 01:46:41,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:46:41,117 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:41,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:41,117 INFO L85 PathProgramCache]: Analyzing trace with hash 520585060, now seen corresponding path program 1 times [2024-11-07 01:46:41,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:41,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898291370] [2024-11-07 01:46:41,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:41,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:41,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:46:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:41,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:46:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:41,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:46:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:41,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:46:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:41,313 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:41,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:41,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898291370] [2024-11-07 01:46:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898291370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:41,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:41,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12297338] [2024-11-07 01:46:41,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:41,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:41,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:41,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:41,316 INFO L87 Difference]: Start difference. First operand 2552 states and 3378 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:43,871 INFO L93 Difference]: Finished difference Result 4632 states and 6692 transitions. [2024-11-07 01:46:43,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:46:43,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-07 01:46:43,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:43,883 INFO L225 Difference]: With dead ends: 4632 [2024-11-07 01:46:43,883 INFO L226 Difference]: Without dead ends: 3725 [2024-11-07 01:46:43,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:46:43,886 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 1568 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 2621 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:43,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 1640 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2621 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:46:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3725 states. [2024-11-07 01:46:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3725 to 3137. [2024-11-07 01:46:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3137 states, 2699 states have (on average 1.379029270100037) internal successors, (3722), 2716 states have internal predecessors, (3722), 241 states have call successors, (241), 147 states have call predecessors, (241), 195 states have return successors, (318), 277 states have call predecessors, (318), 238 states have call successors, (318) [2024-11-07 01:46:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 4281 transitions. [2024-11-07 01:46:44,211 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 4281 transitions. Word has length 146 [2024-11-07 01:46:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:44,211 INFO L471 AbstractCegarLoop]: Abstraction has 3137 states and 4281 transitions. [2024-11-07 01:46:44,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 4281 transitions. [2024-11-07 01:46:44,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:46:44,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:44,216 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] [2024-11-07 01:46:44,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:46:44,218 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:44,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:44,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1467622946, now seen corresponding path program 1 times [2024-11-07 01:46:44,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:44,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3444403] [2024-11-07 01:46:44,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:44,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:44,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:44,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:46:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:44,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:46:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:44,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:46:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:44,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:46:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:44,393 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:44,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:44,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3444403] [2024-11-07 01:46:44,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3444403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:44,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:44,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:44,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29102090] [2024-11-07 01:46:44,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:44,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:44,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:44,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:44,396 INFO L87 Difference]: Start difference. First operand 3137 states and 4281 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:47,118 INFO L93 Difference]: Finished difference Result 6757 states and 10019 transitions. [2024-11-07 01:46:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:46:47,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-07 01:46:47,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:47,137 INFO L225 Difference]: With dead ends: 6757 [2024-11-07 01:46:47,138 INFO L226 Difference]: Without dead ends: 5265 [2024-11-07 01:46:47,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:46:47,144 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 1470 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 3040 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 3135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:47,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 2415 Invalid, 3135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3040 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 01:46:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5265 states. [2024-11-07 01:46:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5265 to 4308. [2024-11-07 01:46:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4308 states, 3770 states have (on average 1.4238726790450928) internal successors, (5368), 3791 states have internal predecessors, (5368), 313 states have call successors, (313), 171 states have call predecessors, (313), 223 states have return successors, (412), 353 states have call predecessors, (412), 310 states have call successors, (412) [2024-11-07 01:46:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4308 states to 4308 states and 6093 transitions. [2024-11-07 01:46:47,507 INFO L78 Accepts]: Start accepts. Automaton has 4308 states and 6093 transitions. Word has length 146 [2024-11-07 01:46:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:47,507 INFO L471 AbstractCegarLoop]: Abstraction has 4308 states and 6093 transitions. [2024-11-07 01:46:47,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:47,508 INFO L276 IsEmpty]: Start isEmpty. Operand 4308 states and 6093 transitions. [2024-11-07 01:46:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:46:47,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 01:46:47,513 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:47,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:47,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1965510748, now seen corresponding path program 1 times [2024-11-07 01:46:47,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:47,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288814789] [2024-11-07 01:46:47,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:47,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:47,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:47,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:46:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:47,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:46:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:47,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:46:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:47,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:46:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:47,701 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:47,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:47,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288814789] [2024-11-07 01:46:47,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288814789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:47,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:47,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:47,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264181180] [2024-11-07 01:46:47,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:47,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:47,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:47,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:47,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:47,702 INFO L87 Difference]: Start difference. First operand 4308 states and 6093 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:50,612 INFO L93 Difference]: Finished difference Result 11006 states and 16689 transitions. [2024-11-07 01:46:50,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:46:50,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-07 01:46:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:50,639 INFO L225 Difference]: With dead ends: 11006 [2024-11-07 01:46:50,639 INFO L226 Difference]: Without dead ends: 8343 [2024-11-07 01:46:50,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:46:50,652 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 1466 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 3031 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:50,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 2415 Invalid, 3126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3031 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 01:46:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8343 states. [2024-11-07 01:46:51,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8343 to 6655. [2024-11-07 01:46:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6655 states, 5917 states have (on average 1.4645935440256888) internal successors, (8666), 5946 states have internal predecessors, (8666), 457 states have call successors, (457), 219 states have call predecessors, (457), 279 states have return successors, (618), 505 states have call predecessors, (618), 454 states have call successors, (618) [2024-11-07 01:46:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6655 states to 6655 states and 9741 transitions. [2024-11-07 01:46:51,205 INFO L78 Accepts]: Start accepts. Automaton has 6655 states and 9741 transitions. Word has length 146 [2024-11-07 01:46:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:51,206 INFO L471 AbstractCegarLoop]: Abstraction has 6655 states and 9741 transitions. [2024-11-07 01:46:51,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 6655 states and 9741 transitions. [2024-11-07 01:46:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:46:51,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:51,212 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] [2024-11-07 01:46:51,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 01:46:51,213 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:51,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:51,213 INFO L85 PathProgramCache]: Analyzing trace with hash 279047650, now seen corresponding path program 1 times [2024-11-07 01:46:51,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:51,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021990223] [2024-11-07 01:46:51,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:51,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:51,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:46:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:51,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:46:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:51,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:46:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:46:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:51,390 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:51,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:51,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021990223] [2024-11-07 01:46:51,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021990223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:51,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:51,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:51,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791765898] [2024-11-07 01:46:51,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:51,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:51,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:51,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:51,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:51,393 INFO L87 Difference]: Start difference. First operand 6655 states and 9741 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:53,186 INFO L93 Difference]: Finished difference Result 13429 states and 20558 transitions. [2024-11-07 01:46:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:46:53,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-07 01:46:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:53,210 INFO L225 Difference]: With dead ends: 13429 [2024-11-07 01:46:53,210 INFO L226 Difference]: Without dead ends: 8419 [2024-11-07 01:46:53,225 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:46:53,226 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1312 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:53,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 1119 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:46:53,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8419 states. [2024-11-07 01:46:53,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8419 to 6655. [2024-11-07 01:46:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6655 states, 5917 states have (on average 1.4617204664525942) internal successors, (8649), 5946 states have internal predecessors, (8649), 457 states have call successors, (457), 219 states have call predecessors, (457), 279 states have return successors, (618), 505 states have call predecessors, (618), 454 states have call successors, (618) [2024-11-07 01:46:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6655 states to 6655 states and 9724 transitions. [2024-11-07 01:46:53,858 INFO L78 Accepts]: Start accepts. Automaton has 6655 states and 9724 transitions. Word has length 146 [2024-11-07 01:46:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:53,858 INFO L471 AbstractCegarLoop]: Abstraction has 6655 states and 9724 transitions. [2024-11-07 01:46:53,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 6655 states and 9724 transitions. [2024-11-07 01:46:53,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:46:53,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:53,863 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] [2024-11-07 01:46:53,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 01:46:53,863 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:53,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:53,863 INFO L85 PathProgramCache]: Analyzing trace with hash 767094756, now seen corresponding path program 1 times [2024-11-07 01:46:53,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:53,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334347267] [2024-11-07 01:46:53,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:53,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:53,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:53,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:46:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:46:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:46:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:46:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,036 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:54,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:54,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334347267] [2024-11-07 01:46:54,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334347267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:54,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:54,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:54,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584301051] [2024-11-07 01:46:54,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:54,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:54,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:54,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:54,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:54,039 INFO L87 Difference]: Start difference. First operand 6655 states and 9724 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:55,713 INFO L93 Difference]: Finished difference Result 13411 states and 20472 transitions. [2024-11-07 01:46:55,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:46:55,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-07 01:46:55,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:55,737 INFO L225 Difference]: With dead ends: 13411 [2024-11-07 01:46:55,737 INFO L226 Difference]: Without dead ends: 8401 [2024-11-07 01:46:55,751 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:46:55,752 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1133 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:55,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1345 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:46:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8401 states. [2024-11-07 01:46:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8401 to 6655. [2024-11-07 01:46:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6655 states, 5917 states have (on average 1.4588473888794997) internal successors, (8632), 5946 states have internal predecessors, (8632), 457 states have call successors, (457), 219 states have call predecessors, (457), 279 states have return successors, (618), 505 states have call predecessors, (618), 454 states have call successors, (618) [2024-11-07 01:46:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6655 states to 6655 states and 9707 transitions. [2024-11-07 01:46:56,538 INFO L78 Accepts]: Start accepts. Automaton has 6655 states and 9707 transitions. Word has length 146 [2024-11-07 01:46:56,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:56,538 INFO L471 AbstractCegarLoop]: Abstraction has 6655 states and 9707 transitions. [2024-11-07 01:46:56,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 6655 states and 9707 transitions. [2024-11-07 01:46:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:46:56,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:56,542 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] [2024-11-07 01:46:56,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 01:46:56,542 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:56,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:56,542 INFO L85 PathProgramCache]: Analyzing trace with hash -325540446, now seen corresponding path program 1 times [2024-11-07 01:46:56,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:56,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027651036] [2024-11-07 01:46:56,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:56,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:56,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:56,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:46:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:56,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:46:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:56,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:46:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:56,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:46:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:56,716 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,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:56,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027651036] [2024-11-07 01:46:56,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027651036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:56,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:56,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:56,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587173405] [2024-11-07 01:46:56,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:56,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:56,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:56,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:56,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:56,719 INFO L87 Difference]: Start difference. First operand 6655 states and 9707 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:59,995 INFO L93 Difference]: Finished difference Result 19448 states and 29815 transitions. [2024-11-07 01:46:59,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:46:59,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-07 01:46:59,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:00,037 INFO L225 Difference]: With dead ends: 19448 [2024-11-07 01:47:00,038 INFO L226 Difference]: Without dead ends: 14438 [2024-11-07 01:47:00,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:47:00,049 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 1452 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 2950 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:00,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 2415 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2950 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 01:47:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14438 states. [2024-11-07 01:47:00,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14438 to 11411. [2024-11-07 01:47:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11411 states, 10273 states have (on average 1.4875888250754405) internal successors, (15282), 10318 states have internal predecessors, (15282), 745 states have call successors, (745), 315 states have call predecessors, (745), 391 states have return successors, (1084), 809 states have call predecessors, (1084), 742 states have call successors, (1084) [2024-11-07 01:47:00,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11411 states to 11411 states and 17111 transitions. [2024-11-07 01:47:00,887 INFO L78 Accepts]: Start accepts. Automaton has 11411 states and 17111 transitions. Word has length 146 [2024-11-07 01:47:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:00,887 INFO L471 AbstractCegarLoop]: Abstraction has 11411 states and 17111 transitions. [2024-11-07 01:47:00,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 11411 states and 17111 transitions. [2024-11-07 01:47:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:47:00,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:00,894 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] [2024-11-07 01:47:00,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 01:47:00,894 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:00,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:00,894 INFO L85 PathProgramCache]: Analyzing trace with hash 2126951136, now seen corresponding path program 1 times [2024-11-07 01:47:00,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:00,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834833832] [2024-11-07 01:47:00,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:00,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:00,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:00,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:47:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:01,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:47:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:01,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:47:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:01,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:47:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:01,055 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:01,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:01,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834833832] [2024-11-07 01:47:01,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834833832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:01,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:01,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:01,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607780026] [2024-11-07 01:47:01,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:01,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:01,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:01,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:01,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:01,056 INFO L87 Difference]: Start difference. First operand 11411 states and 17111 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:02,937 INFO L93 Difference]: Finished difference Result 24341 states and 37700 transitions. [2024-11-07 01:47:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:47:02,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-07 01:47:02,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:02,985 INFO L225 Difference]: With dead ends: 24341 [2024-11-07 01:47:02,985 INFO L226 Difference]: Without dead ends: 14575 [2024-11-07 01:47:03,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:47:03,010 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1131 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:03,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1345 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:47:03,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14575 states. [2024-11-07 01:47:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14575 to 11411. [2024-11-07 01:47:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11411 states, 10273 states have (on average 1.4843765209773192) internal successors, (15249), 10318 states have internal predecessors, (15249), 745 states have call successors, (745), 315 states have call predecessors, (745), 391 states have return successors, (1084), 809 states have call predecessors, (1084), 742 states have call successors, (1084) [2024-11-07 01:47:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11411 states to 11411 states and 17078 transitions. [2024-11-07 01:47:04,039 INFO L78 Accepts]: Start accepts. Automaton has 11411 states and 17078 transitions. Word has length 146 [2024-11-07 01:47:04,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:04,039 INFO L471 AbstractCegarLoop]: Abstraction has 11411 states and 17078 transitions. [2024-11-07 01:47:04,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 11411 states and 17078 transitions. [2024-11-07 01:47:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:47:04,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:04,044 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] [2024-11-07 01:47:04,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 01:47:04,045 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:04,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:04,045 INFO L85 PathProgramCache]: Analyzing trace with hash 404948450, now seen corresponding path program 1 times [2024-11-07 01:47:04,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:04,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800904157] [2024-11-07 01:47:04,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:04,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:04,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:04,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:47:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:04,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:47:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:04,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:47:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:04,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:47:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:04,210 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:04,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:04,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800904157] [2024-11-07 01:47:04,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800904157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:04,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:04,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:04,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436535996] [2024-11-07 01:47:04,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:04,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:04,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:04,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:04,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:04,213 INFO L87 Difference]: Start difference. First operand 11411 states and 17078 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:08,059 INFO L93 Difference]: Finished difference Result 40728 states and 62979 transitions. [2024-11-07 01:47:08,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:47:08,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-07 01:47:08,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:08,151 INFO L225 Difference]: With dead ends: 40728 [2024-11-07 01:47:08,151 INFO L226 Difference]: Without dead ends: 30962 [2024-11-07 01:47:08,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:47:08,182 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 1622 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 3122 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1647 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 3251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 3122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:08,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1647 Valid, 1638 Invalid, 3251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 3122 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 01:47:08,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30962 states. [2024-11-07 01:47:09,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30962 to 20885. [2024-11-07 01:47:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20885 states, 18979 states have (on average 1.5027662152905843) internal successors, (28521), 19056 states have internal predecessors, (28521), 1289 states have call successors, (1289), 507 states have call predecessors, (1289), 615 states have return successors, (2146), 1385 states have call predecessors, (2146), 1286 states have call successors, (2146) [2024-11-07 01:47:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20885 states to 20885 states and 31956 transitions. [2024-11-07 01:47:09,798 INFO L78 Accepts]: Start accepts. Automaton has 20885 states and 31956 transitions. Word has length 146 [2024-11-07 01:47:09,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:09,798 INFO L471 AbstractCegarLoop]: Abstraction has 20885 states and 31956 transitions. [2024-11-07 01:47:09,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:09,798 INFO L276 IsEmpty]: Start isEmpty. Operand 20885 states and 31956 transitions. [2024-11-07 01:47:09,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:47:09,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:09,807 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] [2024-11-07 01:47:09,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 01:47:09,807 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:09,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:09,808 INFO L85 PathProgramCache]: Analyzing trace with hash 72305312, now seen corresponding path program 1 times [2024-11-07 01:47:09,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:09,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691081493] [2024-11-07 01:47:09,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:09,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:09,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:09,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:47:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:09,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:47:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:09,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:47:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:09,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:47:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:09,970 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,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:09,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691081493] [2024-11-07 01:47:09,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691081493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:09,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:09,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:09,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416048066] [2024-11-07 01:47:09,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:09,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:09,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:09,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:09,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:09,972 INFO L87 Difference]: Start difference. First operand 20885 states and 31956 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:15,463 INFO L93 Difference]: Finished difference Result 77976 states and 121975 transitions. [2024-11-07 01:47:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:47:15,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-07 01:47:15,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:15,632 INFO L225 Difference]: With dead ends: 77976 [2024-11-07 01:47:15,632 INFO L226 Difference]: Without dead ends: 58736 [2024-11-07 01:47:15,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:47:15,686 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 1772 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1808 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 2989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:15,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1808 Valid, 2401 Invalid, 2989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2891 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 01:47:15,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58736 states. [2024-11-07 01:47:18,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58736 to 39158. [2024-11-07 01:47:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39158 states, 35748 states have (on average 1.5088676289582634) internal successors, (53939), 35889 states have internal predecessors, (53939), 2345 states have call successors, (2345), 891 states have call predecessors, (2345), 1063 states have return successors, (4724), 2505 states have call predecessors, (4724), 2342 states have call successors, (4724) [2024-11-07 01:47:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39158 states to 39158 states and 61008 transitions. [2024-11-07 01:47:18,219 INFO L78 Accepts]: Start accepts. Automaton has 39158 states and 61008 transitions. Word has length 146 [2024-11-07 01:47:18,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:18,220 INFO L471 AbstractCegarLoop]: Abstraction has 39158 states and 61008 transitions. [2024-11-07 01:47:18,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:18,220 INFO L276 IsEmpty]: Start isEmpty. Operand 39158 states and 61008 transitions. [2024-11-07 01:47:18,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:47:18,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:18,234 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] [2024-11-07 01:47:18,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 01:47:18,234 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:18,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:18,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2001237538, now seen corresponding path program 1 times [2024-11-07 01:47:18,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:18,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806576894] [2024-11-07 01:47:18,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:18,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:18,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:18,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:47:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:18,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:47:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:18,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:47:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:18,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:47:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:18,392 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,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:18,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806576894] [2024-11-07 01:47:18,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806576894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:18,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:18,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:18,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124910787] [2024-11-07 01:47:18,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:18,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:18,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:18,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:18,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:18,394 INFO L87 Difference]: Start difference. First operand 39158 states and 61008 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)