./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+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_3.cil+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', '20da2548babe3ea7ba69c8856235b685b3dad9dcce2cbb8d7159e2037477f2fb'] 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_3.cil+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 20da2548babe3ea7ba69c8856235b685b3dad9dcce2cbb8d7159e2037477f2fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:48:46,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:48:46,842 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:48:46,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:48:46,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:48:46,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:48:46,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:48:46,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:48:46,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:48:46,861 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:48:46,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:48:46,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:48:46,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:48:46,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:48:46,861 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:48:46,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:48:46,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:48:46,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:48:46,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:48:46,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:48:46,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:48:46,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:48:46,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:48:46,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:48:46,862 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:48:46,862 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:48:46,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:48:46,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:48:46,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:48:46,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:48:46,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:48:46,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:48:46,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:48:46,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:48:46,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:48:46,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:48:46,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:48:46,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:48:46,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:48:46,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:48:46,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:48:46,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:48:46,863 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 -> 20da2548babe3ea7ba69c8856235b685b3dad9dcce2cbb8d7159e2037477f2fb [2024-11-07 01:48:47,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:48:47,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:48:47,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:48:47,129 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:48:47,129 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:48:47,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c [2024-11-07 01:48:48,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:48:48,595 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:48:48,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c [2024-11-07 01:48:48,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7fb7d65fb/cbfc1bdd44274c39b85aa773e02e1d7d/FLAG7477733e7 [2024-11-07 01:48:48,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7fb7d65fb/cbfc1bdd44274c39b85aa773e02e1d7d [2024-11-07 01:48:48,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:48:48,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:48:48,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:48:48,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:48:48,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:48:48,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:48:48" (1/1) ... [2024-11-07 01:48:48,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@578ee89d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:48, skipping insertion in model container [2024-11-07 01:48:48,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:48:48" (1/1) ... [2024-11-07 01:48:48,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:48:48,794 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_3.cil+token_ring.09.cil-2.c[911,924] [2024-11-07 01:48:48,851 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_3.cil+token_ring.09.cil-2.c[8416,8429] [2024-11-07 01:48:48,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:48:48,944 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:48:48,952 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_3.cil+token_ring.09.cil-2.c[911,924] [2024-11-07 01:48:48,971 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_3.cil+token_ring.09.cil-2.c[8416,8429] [2024-11-07 01:48:49,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:48:49,032 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:48:49,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:49 WrapperNode [2024-11-07 01:48:49,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:48:49,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:48:49,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:48:49,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:48:49,040 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:48:49" (1/1) ... [2024-11-07 01:48:49,053 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:48:49" (1/1) ... [2024-11-07 01:48:49,094 INFO L138 Inliner]: procedures = 73, calls = 89, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 932 [2024-11-07 01:48:49,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:48:49,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:48:49,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:48:49,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:48:49,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:49" (1/1) ... [2024-11-07 01:48:49,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:49" (1/1) ... [2024-11-07 01:48:49,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:49" (1/1) ... [2024-11-07 01:48:49,114 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:48:49,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:49" (1/1) ... [2024-11-07 01:48:49,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:49" (1/1) ... [2024-11-07 01:48:49,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:49" (1/1) ... [2024-11-07 01:48:49,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:49" (1/1) ... [2024-11-07 01:48:49,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:49" (1/1) ... [2024-11-07 01:48:49,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:49" (1/1) ... [2024-11-07 01:48:49,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:48:49,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:48:49,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:48:49,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:48:49,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:49" (1/1) ... [2024-11-07 01:48:49,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:48:49,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:48:49,178 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:48:49,183 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:48:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:48:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:48:49,200 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:48:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-07 01:48:49,200 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-07 01:48:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:48:49,200 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:48:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:48:49,200 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:48:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-07 01:48:49,201 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-07 01:48:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:48:49,201 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:48:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:48:49,201 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:48:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-07 01:48:49,201 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-07 01:48:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-07 01:48:49,201 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-07 01:48:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-07 01:48:49,201 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-07 01:48:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:48:49,201 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:48:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:48:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:48:49,201 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:48:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-07 01:48:49,201 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-07 01:48:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:48:49,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:48:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:48:49,201 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:48:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-07 01:48:49,201 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-07 01:48:49,295 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:48:49,296 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:48:49,860 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-07 01:48:49,860 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-11-07 01:48:49,981 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-07 01:48:49,982 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:48:49,993 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:48:49,993 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-07 01:48:49,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:48:49 BoogieIcfgContainer [2024-11-07 01:48:49,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:48:49,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:48:49,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:48:49,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:48:49,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:48:48" (1/3) ... [2024-11-07 01:48:49,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ee4024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:48:49, skipping insertion in model container [2024-11-07 01:48:49,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:49" (2/3) ... [2024-11-07 01:48:49,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ee4024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:48:49, skipping insertion in model container [2024-11-07 01:48:50,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:48:49" (3/3) ... [2024-11-07 01:48:50,000 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.09.cil-2.c [2024-11-07 01:48:50,011 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:48:50,011 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:48:50,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:48:50,101 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;@28a55c49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:48:50,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:48:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 442 states, 383 states have (on average 1.6135770234986946) internal successors, (618), 391 states have internal predecessors, (618), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-07 01:48:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:48:50,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:50,115 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:48:50,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:50,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:50,119 INFO L85 PathProgramCache]: Analyzing trace with hash -21707318, now seen corresponding path program 1 times [2024-11-07 01:48:50,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:50,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554992450] [2024-11-07 01:48:50,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:50,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:50,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:50,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:50,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:48:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:50,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:48:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:50,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:48:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:50,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:50,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:48:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:50,484 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:48:50,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:50,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554992450] [2024-11-07 01:48:50,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554992450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:50,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:50,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:48:50,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018085441] [2024-11-07 01:48:50,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:50,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:48:50,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:50,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:48:50,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:48:50,528 INFO L87 Difference]: Start difference. First operand has 442 states, 383 states have (on average 1.6135770234986946) internal successors, (618), 391 states have internal predecessors, (618), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:48:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:51,288 INFO L93 Difference]: Finished difference Result 877 states and 1388 transitions. [2024-11-07 01:48:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 01:48:51,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 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:48:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:51,304 INFO L225 Difference]: With dead ends: 877 [2024-11-07 01:48:51,306 INFO L226 Difference]: Without dead ends: 449 [2024-11-07 01:48:51,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:48:51,317 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 942 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:51,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 1267 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:48:51,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-07 01:48:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 431. [2024-11-07 01:48:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 375 states have (on average 1.528) internal successors, (573), 380 states have internal predecessors, (573), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-07 01:48:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 651 transitions. [2024-11-07 01:48:51,385 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 651 transitions. Word has length 65 [2024-11-07 01:48:51,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:51,385 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 651 transitions. [2024-11-07 01:48:51,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:48:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 651 transitions. [2024-11-07 01:48:51,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:48:51,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:51,388 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:48:51,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:48:51,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:51,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:51,389 INFO L85 PathProgramCache]: Analyzing trace with hash -62382068, now seen corresponding path program 1 times [2024-11-07 01:48:51,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:51,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122565707] [2024-11-07 01:48:51,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:51,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:51,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:51,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:51,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:48:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:51,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:48:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:51,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:48:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:51,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:51,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:48:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:51,597 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:48:51,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:51,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122565707] [2024-11-07 01:48:51,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122565707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:51,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:51,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:48:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282361175] [2024-11-07 01:48:51,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:51,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:48:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:51,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:48:51,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:51,600 INFO L87 Difference]: Start difference. First operand 431 states and 651 transitions. 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:48:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:52,510 INFO L93 Difference]: Finished difference Result 686 states and 1020 transitions. [2024-11-07 01:48:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:48:52,510 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:48:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:52,514 INFO L225 Difference]: With dead ends: 686 [2024-11-07 01:48:52,514 INFO L226 Difference]: Without dead ends: 582 [2024-11-07 01:48:52,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:48:52,515 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 1117 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:52,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 1925 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:48:52,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-07 01:48:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 543. [2024-11-07 01:48:52,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 465 states have (on average 1.5032258064516129) internal successors, (699), 472 states have internal predecessors, (699), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-11-07 01:48:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 808 transitions. [2024-11-07 01:48:52,558 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 808 transitions. Word has length 65 [2024-11-07 01:48:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:52,558 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 808 transitions. [2024-11-07 01:48:52,558 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:48:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 808 transitions. [2024-11-07 01:48:52,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:48:52,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:52,560 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:48:52,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:48:52,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:52,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:52,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1616506572, now seen corresponding path program 1 times [2024-11-07 01:48:52,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:52,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069849093] [2024-11-07 01:48:52,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:52,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:52,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:52,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:52,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:48:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:52,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:48:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:52,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:48:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:52,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:48:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:52,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:48:52,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:52,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069849093] [2024-11-07 01:48:52,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069849093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:52,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:52,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:48:52,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683445401] [2024-11-07 01:48:52,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:52,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:48:52,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:52,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:48:52,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:52,702 INFO L87 Difference]: Start difference. First operand 543 states and 808 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:48:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:53,731 INFO L93 Difference]: Finished difference Result 940 states and 1373 transitions. [2024-11-07 01:48:53,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:48:53,732 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:48:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:53,735 INFO L225 Difference]: With dead ends: 940 [2024-11-07 01:48:53,736 INFO L226 Difference]: Without dead ends: 731 [2024-11-07 01:48:53,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:48:53,737 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 1246 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:53,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 2305 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1628 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:48:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-07 01:48:53,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 655. [2024-11-07 01:48:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 555 states have (on average 1.4846846846846846) internal successors, (824), 564 states have internal predecessors, (824), 67 states have call successors, (67), 29 states have call predecessors, (67), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) [2024-11-07 01:48:53,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 967 transitions. [2024-11-07 01:48:53,768 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 967 transitions. Word has length 65 [2024-11-07 01:48:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:53,768 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 967 transitions. [2024-11-07 01:48:53,768 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:48:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 967 transitions. [2024-11-07 01:48:53,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:48:53,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:53,771 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:48:53,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:48:53,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:53,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:53,772 INFO L85 PathProgramCache]: Analyzing trace with hash -412079538, now seen corresponding path program 1 times [2024-11-07 01:48:53,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:53,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130270239] [2024-11-07 01:48:53,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:53,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:53,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:53,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:53,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:48:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:53,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:48:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:53,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:48:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:53,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:53,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:48:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:53,908 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:48:53,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:53,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130270239] [2024-11-07 01:48:53,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130270239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:53,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:53,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:53,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826170421] [2024-11-07 01:48:53,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:53,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:53,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:53,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:53,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:53,911 INFO L87 Difference]: Start difference. First operand 655 states and 967 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), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:48:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:54,727 INFO L93 Difference]: Finished difference Result 1327 states and 1909 transitions. [2024-11-07 01:48:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:48:54,729 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), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-07 01:48:54,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:54,736 INFO L225 Difference]: With dead ends: 1327 [2024-11-07 01:48:54,737 INFO L226 Difference]: Without dead ends: 1012 [2024-11-07 01:48:54,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:48:54,751 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 1353 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:54,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 1812 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:48:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-11-07 01:48:54,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 936. [2024-11-07 01:48:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 781 states have (on average 1.4481434058898848) internal successors, (1131), 794 states have internal predecessors, (1131), 97 states have call successors, (97), 50 states have call predecessors, (97), 56 states have return successors, (114), 95 states have call predecessors, (114), 93 states have call successors, (114) [2024-11-07 01:48:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1342 transitions. [2024-11-07 01:48:54,808 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1342 transitions. Word has length 65 [2024-11-07 01:48:54,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:54,809 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1342 transitions. [2024-11-07 01:48:54,809 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), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:48:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1342 transitions. [2024-11-07 01:48:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:48:54,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:54,812 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:48:54,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:48:54,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:54,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:54,813 INFO L85 PathProgramCache]: Analyzing trace with hash -980744661, now seen corresponding path program 1 times [2024-11-07 01:48:54,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:54,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334499719] [2024-11-07 01:48:54,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:54,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:54,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:54,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:54,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:48:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:54,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:48:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:54,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:48:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:54,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 01:48:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:54,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:48:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:54,977 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:48:54,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:54,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334499719] [2024-11-07 01:48:54,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334499719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:54,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:54,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:48:54,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304562032] [2024-11-07 01:48:54,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:54,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:48:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:54,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:48:54,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:48:54,982 INFO L87 Difference]: Start difference. First operand 936 states and 1342 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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:48:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:56,200 INFO L93 Difference]: Finished difference Result 1604 states and 2269 transitions. [2024-11-07 01:48:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:48:56,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2024-11-07 01:48:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:56,209 INFO L225 Difference]: With dead ends: 1604 [2024-11-07 01:48:56,209 INFO L226 Difference]: Without dead ends: 1008 [2024-11-07 01:48:56,210 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:48:56,210 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 546 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:56,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 2651 Invalid, 1833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:48:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2024-11-07 01:48:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 951. [2024-11-07 01:48:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 793 states have (on average 1.4375788146279949) internal successors, (1140), 806 states have internal predecessors, (1140), 97 states have call successors, (97), 50 states have call predecessors, (97), 59 states have return successors, (117), 98 states have call predecessors, (117), 93 states have call successors, (117) [2024-11-07 01:48:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1354 transitions. [2024-11-07 01:48:56,266 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1354 transitions. Word has length 66 [2024-11-07 01:48:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:56,266 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1354 transitions. [2024-11-07 01:48:56,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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:48:56,267 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1354 transitions. [2024-11-07 01:48:56,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:48:56,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:56,269 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:48:56,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:48:56,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:56,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2010103959, now seen corresponding path program 1 times [2024-11-07 01:48:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:56,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787052713] [2024-11-07 01:48:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:56,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:56,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:56,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:48:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:56,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:48:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:56,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:48:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:56,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 01:48:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:56,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:48:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:56,438 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:48:56,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:56,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787052713] [2024-11-07 01:48:56,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787052713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:56,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:56,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:48:56,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628550563] [2024-11-07 01:48:56,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:56,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:48:56,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:56,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:48:56,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:48:56,440 INFO L87 Difference]: Start difference. First operand 951 states and 1354 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:48:58,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:58,129 INFO L93 Difference]: Finished difference Result 3156 states and 4475 transitions. [2024-11-07 01:48:58,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 01:48:58,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2024-11-07 01:48:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:58,135 INFO L225 Difference]: With dead ends: 3156 [2024-11-07 01:48:58,135 INFO L226 Difference]: Without dead ends: 1314 [2024-11-07 01:48:58,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 01:48:58,141 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 2560 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2578 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 2581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:58,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2578 Valid, 2254 Invalid, 2581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 2157 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:48:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2024-11-07 01:48:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1159. [2024-11-07 01:48:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 945 states have (on average 1.4010582010582011) internal successors, (1324), 962 states have internal predecessors, (1324), 127 states have call successors, (127), 71 states have call predecessors, (127), 85 states have return successors, (166), 129 states have call predecessors, (166), 123 states have call successors, (166) [2024-11-07 01:48:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1617 transitions. [2024-11-07 01:48:58,213 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1617 transitions. Word has length 66 [2024-11-07 01:48:58,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:58,215 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1617 transitions. [2024-11-07 01:48:58,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:48:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1617 transitions. [2024-11-07 01:48:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 01:48:58,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:58,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] [2024-11-07 01:48:58,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:48:58,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:58,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:58,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1560992659, now seen corresponding path program 1 times [2024-11-07 01:48:58,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:58,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480073157] [2024-11-07 01:48:58,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:58,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:58,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:58,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:58,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:48:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:58,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:48:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:58,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:48:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:58,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 01:48:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:58,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:48:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:58,336 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:48:58,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:58,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480073157] [2024-11-07 01:48:58,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480073157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:58,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:58,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:48:58,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788454033] [2024-11-07 01:48:58,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:58,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:48:58,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:58,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:48:58,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:48:58,338 INFO L87 Difference]: Start difference. First operand 1159 states and 1617 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:48:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:59,202 INFO L93 Difference]: Finished difference Result 2344 states and 3242 transitions. [2024-11-07 01:48:59,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 01:48:59,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 67 [2024-11-07 01:48:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:59,205 INFO L225 Difference]: With dead ends: 2344 [2024-11-07 01:48:59,205 INFO L226 Difference]: Without dead ends: 320 [2024-11-07 01:48:59,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-11-07 01:48:59,210 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 1328 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:59,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 2207 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:48:59,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-07 01:48:59,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-11-07 01:48:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 288 states have (on average 1.5520833333333333) internal successors, (447), 290 states have internal predecessors, (447), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 01:48:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 495 transitions. [2024-11-07 01:48:59,237 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 495 transitions. Word has length 67 [2024-11-07 01:48:59,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:59,237 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 495 transitions. [2024-11-07 01:48:59,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:48:59,237 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 495 transitions. [2024-11-07 01:48:59,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:48:59,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:59,238 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:48:59,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:48:59,239 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:59,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:59,239 INFO L85 PathProgramCache]: Analyzing trace with hash 317817319, now seen corresponding path program 1 times [2024-11-07 01:48:59,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:59,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185113611] [2024-11-07 01:48:59,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:59,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:59,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:59,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:48:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:59,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:59,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:48:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:59,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:48:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:59,370 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:48:59,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:59,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185113611] [2024-11-07 01:48:59,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185113611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:59,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:59,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:48:59,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104974160] [2024-11-07 01:48:59,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:59,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:48:59,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:59,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:48:59,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:48:59,374 INFO L87 Difference]: Start difference. First operand 320 states and 495 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:49:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:00,345 INFO L93 Difference]: Finished difference Result 735 states and 1155 transitions. [2024-11-07 01:49:00,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:49:00,345 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:49:00,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:00,348 INFO L225 Difference]: With dead ends: 735 [2024-11-07 01:49:00,349 INFO L226 Difference]: Without dead ends: 429 [2024-11-07 01:49:00,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:49:00,350 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 830 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:00,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 651 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:49:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-07 01:49:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 320. [2024-11-07 01:49:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 288 states have (on average 1.5486111111111112) internal successors, (446), 290 states have internal predecessors, (446), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 01:49:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 494 transitions. [2024-11-07 01:49:00,367 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 494 transitions. Word has length 146 [2024-11-07 01:49:00,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:00,368 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 494 transitions. [2024-11-07 01:49:00,368 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:49:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 494 transitions. [2024-11-07 01:49:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:49:00,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:00,369 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:49:00,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:49:00,370 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:00,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash 862689893, now seen corresponding path program 1 times [2024-11-07 01:49:00,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:00,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63633552] [2024-11-07 01:49:00,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:00,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:00,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:00,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:49:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:00,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:49:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:00,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:49:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:00,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:49:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:00,528 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:49:00,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:00,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63633552] [2024-11-07 01:49:00,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63633552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:00,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:00,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:49:00,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651018690] [2024-11-07 01:49:00,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:00,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:49:00,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:00,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:49:00,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:49:00,530 INFO L87 Difference]: Start difference. First operand 320 states and 494 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:49:02,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:02,554 INFO L93 Difference]: Finished difference Result 1154 states and 1825 transitions. [2024-11-07 01:49:02,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:49:02,555 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:49:02,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:02,562 INFO L225 Difference]: With dead ends: 1154 [2024-11-07 01:49:02,562 INFO L226 Difference]: Without dead ends: 852 [2024-11-07 01:49:02,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:49:02,563 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 1242 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:02,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 1111 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:49:02,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-11-07 01:49:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 633. [2024-11-07 01:49:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 576 states have (on average 1.5607638888888888) internal successors, (899), 579 states have internal predecessors, (899), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-11-07 01:49:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 986 transitions. [2024-11-07 01:49:02,614 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 986 transitions. Word has length 146 [2024-11-07 01:49:02,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:02,614 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 986 transitions. [2024-11-07 01:49:02,614 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:49:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 986 transitions. [2024-11-07 01:49:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:49:02,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:02,615 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:49:02,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:49:02,615 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:02,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:02,616 INFO L85 PathProgramCache]: Analyzing trace with hash 433031587, now seen corresponding path program 1 times [2024-11-07 01:49:02,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:02,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754208741] [2024-11-07 01:49:02,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:02,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:02,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:02,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:49:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:02,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:49:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:02,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:49:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:02,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:49:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:02,890 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:49:02,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:02,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754208741] [2024-11-07 01:49:02,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754208741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:02,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:02,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:02,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562855776] [2024-11-07 01:49:02,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:02,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:02,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:02,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:02,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:02,892 INFO L87 Difference]: Start difference. First operand 633 states and 986 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:49:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:05,313 INFO L93 Difference]: Finished difference Result 1902 states and 3012 transitions. [2024-11-07 01:49:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:05,314 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:49:05,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:05,318 INFO L225 Difference]: With dead ends: 1902 [2024-11-07 01:49:05,321 INFO L226 Difference]: Without dead ends: 1287 [2024-11-07 01:49:05,322 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:49:05,322 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 1261 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 2816 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 2875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:05,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 2151 Invalid, 2875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2816 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 01:49:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2024-11-07 01:49:05,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 925. [2024-11-07 01:49:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 843 states have (on average 1.5539739027283512) internal successors, (1310), 847 states have internal predecessors, (1310), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-11-07 01:49:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1435 transitions. [2024-11-07 01:49:05,395 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1435 transitions. Word has length 146 [2024-11-07 01:49:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:05,395 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1435 transitions. [2024-11-07 01:49:05,395 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:49:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1435 transitions. [2024-11-07 01:49:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:49:05,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:05,400 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:49:05,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:49:05,401 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:05,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:05,401 INFO L85 PathProgramCache]: Analyzing trace with hash -273565019, now seen corresponding path program 1 times [2024-11-07 01:49:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:05,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090366310] [2024-11-07 01:49:05,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:05,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:05,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:05,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:49:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:05,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:49:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:05,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:49:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:05,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:49:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:05,627 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:49:05,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:05,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090366310] [2024-11-07 01:49:05,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090366310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:05,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:05,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:05,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238409251] [2024-11-07 01:49:05,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:05,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:05,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:05,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:05,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:05,629 INFO L87 Difference]: Start difference. First operand 925 states and 1435 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:49:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:08,246 INFO L93 Difference]: Finished difference Result 3005 states and 4749 transitions. [2024-11-07 01:49:08,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:08,247 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:49:08,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:08,254 INFO L225 Difference]: With dead ends: 3005 [2024-11-07 01:49:08,254 INFO L226 Difference]: Without dead ends: 2098 [2024-11-07 01:49:08,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:49:08,257 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1259 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 2812 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 2873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:08,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 2149 Invalid, 2873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2812 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 01:49:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2024-11-07 01:49:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1510. [2024-11-07 01:49:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1378 states have (on average 1.5478955007256894) internal successors, (2133), 1384 states have internal predecessors, (2133), 97 states have call successors, (97), 31 states have call predecessors, (97), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-11-07 01:49:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2338 transitions. [2024-11-07 01:49:08,335 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2338 transitions. Word has length 146 [2024-11-07 01:49:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:08,335 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2338 transitions. [2024-11-07 01:49:08,335 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:49:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2338 transitions. [2024-11-07 01:49:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:49:08,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:08,337 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:49:08,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:49:08,337 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:08,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash 673472867, now seen corresponding path program 1 times [2024-11-07 01:49:08,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:08,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373315729] [2024-11-07 01:49:08,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:08,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:49:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:49:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:49:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:49:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:49:08,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:08,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373315729] [2024-11-07 01:49:08,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373315729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:08,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:08,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:08,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125685491] [2024-11-07 01:49:08,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:08,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:08,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:08,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:08,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:08,510 INFO L87 Difference]: Start difference. First operand 1510 states and 2338 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:49:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:09,696 INFO L93 Difference]: Finished difference Result 3578 states and 5643 transitions. [2024-11-07 01:49:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:09,697 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:49:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:09,705 INFO L225 Difference]: With dead ends: 3578 [2024-11-07 01:49:09,705 INFO L226 Difference]: Without dead ends: 2086 [2024-11-07 01:49:09,709 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:49:09,709 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 913 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:09,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 1079 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:49:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2024-11-07 01:49:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 1510. [2024-11-07 01:49:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1378 states have (on average 1.544267053701016) internal successors, (2128), 1384 states have internal predecessors, (2128), 97 states have call successors, (97), 31 states have call predecessors, (97), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-11-07 01:49:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2333 transitions. [2024-11-07 01:49:09,792 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2333 transitions. Word has length 146 [2024-11-07 01:49:09,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:09,793 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2333 transitions. [2024-11-07 01:49:09,793 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:49:09,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2333 transitions. [2024-11-07 01:49:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:49:09,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:09,795 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:49:09,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:49:09,795 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:09,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1535306469, now seen corresponding path program 1 times [2024-11-07 01:49:09,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:09,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415725572] [2024-11-07 01:49:09,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:09,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:09,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:09,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:49:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:09,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:49:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:09,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:49:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:09,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:49:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:09,942 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:49:09,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:09,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415725572] [2024-11-07 01:49:09,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415725572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:09,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:09,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:09,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746794147] [2024-11-07 01:49:09,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:09,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:09,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:09,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:09,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:09,944 INFO L87 Difference]: Start difference. First operand 1510 states and 2333 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:49:10,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:10,997 INFO L93 Difference]: Finished difference Result 3572 states and 5617 transitions. [2024-11-07 01:49:10,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:10,997 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:49:10,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:11,005 INFO L225 Difference]: With dead ends: 3572 [2024-11-07 01:49:11,006 INFO L226 Difference]: Without dead ends: 2080 [2024-11-07 01:49:11,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:49:11,010 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 1042 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:11,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 904 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:49:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2024-11-07 01:49:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1510. [2024-11-07 01:49:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1378 states have (on average 1.5406386066763424) internal successors, (2123), 1384 states have internal predecessors, (2123), 97 states have call successors, (97), 31 states have call predecessors, (97), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-11-07 01:49:11,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2328 transitions. [2024-11-07 01:49:11,098 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2328 transitions. Word has length 146 [2024-11-07 01:49:11,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:11,099 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2328 transitions. [2024-11-07 01:49:11,099 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:49:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2328 transitions. [2024-11-07 01:49:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:49:11,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:11,101 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:49:11,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:49:11,101 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:11,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:11,101 INFO L85 PathProgramCache]: Analyzing trace with hash -515102429, now seen corresponding path program 1 times [2024-11-07 01:49:11,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:11,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344542050] [2024-11-07 01:49:11,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:11,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:11,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:11,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:49:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:11,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:49:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:11,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:49:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:11,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:49:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:11,267 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:49:11,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:11,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344542050] [2024-11-07 01:49:11,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344542050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:11,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:11,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:11,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311712097] [2024-11-07 01:49:11,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:11,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:11,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:11,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:11,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:11,268 INFO L87 Difference]: Start difference. First operand 1510 states and 2328 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:49:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:13,702 INFO L93 Difference]: Finished difference Result 5115 states and 8002 transitions. [2024-11-07 01:49:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:13,702 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:49:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:13,714 INFO L225 Difference]: With dead ends: 5115 [2024-11-07 01:49:13,714 INFO L226 Difference]: Without dead ends: 3623 [2024-11-07 01:49:13,717 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:49:13,717 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1239 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 2755 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 2816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:13,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 2149 Invalid, 2816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2755 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:49:13,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2024-11-07 01:49:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 2689. [2024-11-07 01:49:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2457 states have (on average 1.534798534798535) internal successors, (3771), 2467 states have internal predecessors, (3771), 169 states have call successors, (169), 55 states have call predecessors, (169), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-11-07 01:49:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 4142 transitions. [2024-11-07 01:49:13,873 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 4142 transitions. Word has length 146 [2024-11-07 01:49:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:13,873 INFO L471 AbstractCegarLoop]: Abstraction has 2689 states and 4142 transitions. [2024-11-07 01:49:13,873 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:49:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 4142 transitions. [2024-11-07 01:49:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:49:13,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:13,875 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:49:13,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:49:13,875 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:13,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:13,876 INFO L85 PathProgramCache]: Analyzing trace with hash -27055323, now seen corresponding path program 1 times [2024-11-07 01:49:13,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:13,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871248446] [2024-11-07 01:49:13,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:13,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:13,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:49:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:49:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:49:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:49:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,070 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:49:14,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:14,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871248446] [2024-11-07 01:49:14,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871248446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:14,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:14,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:14,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759499099] [2024-11-07 01:49:14,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:14,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:14,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:14,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:14,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:14,072 INFO L87 Difference]: Start difference. First operand 2689 states and 4142 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:49:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:15,447 INFO L93 Difference]: Finished difference Result 6308 states and 9873 transitions. [2024-11-07 01:49:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:15,448 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:49:15,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:15,460 INFO L225 Difference]: With dead ends: 6308 [2024-11-07 01:49:15,460 INFO L226 Difference]: Without dead ends: 3637 [2024-11-07 01:49:15,466 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:49:15,466 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 915 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:15,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 1079 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:49:15,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2024-11-07 01:49:15,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 2689. [2024-11-07 01:49:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2457 states have (on average 1.531135531135531) internal successors, (3762), 2467 states have internal predecessors, (3762), 169 states have call successors, (169), 55 states have call predecessors, (169), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-11-07 01:49:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 4133 transitions. [2024-11-07 01:49:15,623 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 4133 transitions. Word has length 146 [2024-11-07 01:49:15,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:15,623 INFO L471 AbstractCegarLoop]: Abstraction has 2689 states and 4133 transitions. [2024-11-07 01:49:15,623 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:49:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 4133 transitions. [2024-11-07 01:49:15,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:49:15,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:15,625 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:49:15,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:49:15,625 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:15,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:15,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1119690525, now seen corresponding path program 1 times [2024-11-07 01:49:15,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:15,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193206558] [2024-11-07 01:49:15,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:15,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:49:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:49:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:49:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:49:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,826 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:49:15,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:15,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193206558] [2024-11-07 01:49:15,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193206558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:15,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:15,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:15,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960593956] [2024-11-07 01:49:15,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:15,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:15,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:15,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:15,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:15,829 INFO L87 Difference]: Start difference. First operand 2689 states and 4133 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:49:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:17,077 INFO L93 Difference]: Finished difference Result 6288 states and 9807 transitions. [2024-11-07 01:49:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:17,077 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:49:17,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:17,090 INFO L225 Difference]: With dead ends: 6288 [2024-11-07 01:49:17,091 INFO L226 Difference]: Without dead ends: 3617 [2024-11-07 01:49:17,097 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:49:17,097 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 958 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:17,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 1078 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:49:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2024-11-07 01:49:17,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 2689. [2024-11-07 01:49:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2457 states have (on average 1.5274725274725274) internal successors, (3753), 2467 states have internal predecessors, (3753), 169 states have call successors, (169), 55 states have call predecessors, (169), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-11-07 01:49:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 4124 transitions. [2024-11-07 01:49:17,230 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 4124 transitions. Word has length 146 [2024-11-07 01:49:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:17,230 INFO L471 AbstractCegarLoop]: Abstraction has 2689 states and 4124 transitions. [2024-11-07 01:49:17,230 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:49:17,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 4124 transitions. [2024-11-07 01:49:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:49:17,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:17,232 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:49:17,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:49:17,232 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:17,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:17,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1332801057, now seen corresponding path program 1 times [2024-11-07 01:49:17,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:17,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988575684] [2024-11-07 01:49:17,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:17,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:49:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:49:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:49:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:49:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,381 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:49:17,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:17,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988575684] [2024-11-07 01:49:17,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988575684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:17,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:17,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:17,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531065748] [2024-11-07 01:49:17,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:17,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:17,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:17,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:17,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:17,384 INFO L87 Difference]: Start difference. First operand 2689 states and 4124 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:49:19,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:19,871 INFO L93 Difference]: Finished difference Result 9332 states and 14482 transitions. [2024-11-07 01:49:19,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:19,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:49:19,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:19,894 INFO L225 Difference]: With dead ends: 9332 [2024-11-07 01:49:19,895 INFO L226 Difference]: Without dead ends: 6661 [2024-11-07 01:49:19,899 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:49:19,899 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1226 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 2673 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:19,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 2149 Invalid, 2734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2673 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:49:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2024-11-07 01:49:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 5075. [2024-11-07 01:49:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5075 states, 4643 states have (on average 1.5227223777729917) internal successors, (7070), 4661 states have internal predecessors, (7070), 313 states have call successors, (313), 103 states have call predecessors, (313), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-11-07 01:49:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5075 states to 5075 states and 7791 transitions. [2024-11-07 01:49:20,172 INFO L78 Accepts]: Start accepts. Automaton has 5075 states and 7791 transitions. Word has length 146 [2024-11-07 01:49:20,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:20,172 INFO L471 AbstractCegarLoop]: Abstraction has 5075 states and 7791 transitions. [2024-11-07 01:49:20,173 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:49:20,173 INFO L276 IsEmpty]: Start isEmpty. Operand 5075 states and 7791 transitions. [2024-11-07 01:49:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:49:20,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:20,177 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:49:20,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:49:20,177 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:20,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:20,178 INFO L85 PathProgramCache]: Analyzing trace with hash -389201629, now seen corresponding path program 1 times [2024-11-07 01:49:20,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:20,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324289979] [2024-11-07 01:49:20,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:20,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:20,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:20,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:49:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:20,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:49:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:20,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:49:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:20,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:49:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:20,314 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:49:20,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:20,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324289979] [2024-11-07 01:49:20,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324289979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:20,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:20,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:20,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787011868] [2024-11-07 01:49:20,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:20,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:20,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:20,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:20,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:20,317 INFO L87 Difference]: Start difference. First operand 5075 states and 7791 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:49:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:21,788 INFO L93 Difference]: Finished difference Result 11760 states and 18304 transitions. [2024-11-07 01:49:21,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:21,788 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:49:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:21,804 INFO L225 Difference]: With dead ends: 11760 [2024-11-07 01:49:21,804 INFO L226 Difference]: Without dead ends: 6703 [2024-11-07 01:49:21,812 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:49:21,812 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 909 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:21,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1077 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:49:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6703 states. [2024-11-07 01:49:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6703 to 5075. [2024-11-07 01:49:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5075 states, 4643 states have (on average 1.5190609519707086) internal successors, (7053), 4661 states have internal predecessors, (7053), 313 states have call successors, (313), 103 states have call predecessors, (313), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-11-07 01:49:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5075 states to 5075 states and 7774 transitions. [2024-11-07 01:49:22,052 INFO L78 Accepts]: Start accepts. Automaton has 5075 states and 7774 transitions. Word has length 146 [2024-11-07 01:49:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:22,052 INFO L471 AbstractCegarLoop]: Abstraction has 5075 states and 7774 transitions. [2024-11-07 01:49:22,053 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:49:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 5075 states and 7774 transitions. [2024-11-07 01:49:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:49:22,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:22,056 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:49:22,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:49:22,056 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:22,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash -721844767, now seen corresponding path program 1 times [2024-11-07 01:49:22,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:22,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100820211] [2024-11-07 01:49:22,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:22,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:22,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:22,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:49:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:22,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:49:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:22,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:49:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:22,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:49:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:22,244 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:49:22,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:22,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100820211] [2024-11-07 01:49:22,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100820211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:22,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:22,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:22,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412061986] [2024-11-07 01:49:22,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:22,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:22,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:22,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:22,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:22,246 INFO L87 Difference]: Start difference. First operand 5075 states and 7774 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:49:25,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:25,587 INFO L93 Difference]: Finished difference Result 19774 states and 30599 transitions. [2024-11-07 01:49:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:49:25,588 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:49:25,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:25,625 INFO L225 Difference]: With dead ends: 19774 [2024-11-07 01:49:25,625 INFO L226 Difference]: Without dead ends: 14717 [2024-11-07 01:49:25,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:49:25,635 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 1547 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 2627 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:25,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 2135 Invalid, 2691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2627 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 01:49:25,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14717 states. [2024-11-07 01:49:26,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14717 to 9665. [2024-11-07 01:49:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9665 states, 8849 states have (on average 1.5119222511018193) internal successors, (13379), 8883 states have internal predecessors, (13379), 585 states have call successors, (585), 199 states have call predecessors, (585), 230 states have return successors, (858), 614 states have call predecessors, (858), 583 states have call successors, (858) [2024-11-07 01:49:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9665 states to 9665 states and 14822 transitions. [2024-11-07 01:49:26,222 INFO L78 Accepts]: Start accepts. Automaton has 9665 states and 14822 transitions. Word has length 146 [2024-11-07 01:49:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:26,223 INFO L471 AbstractCegarLoop]: Abstraction has 9665 states and 14822 transitions. [2024-11-07 01:49:26,223 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:49:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 9665 states and 14822 transitions. [2024-11-07 01:49:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:49:26,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:26,228 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:49:26,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:49:26,229 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:26,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:26,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1207087459, now seen corresponding path program 1 times [2024-11-07 01:49:26,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:26,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167077956] [2024-11-07 01:49:26,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:49:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:49:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:49:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:49:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,364 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:49:26,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:26,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167077956] [2024-11-07 01:49:26,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167077956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:26,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:26,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:26,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601109596] [2024-11-07 01:49:26,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:26,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:26,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:26,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:26,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:26,367 INFO L87 Difference]: Start difference. First operand 9665 states and 14822 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:49:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:30,179 INFO L93 Difference]: Finished difference Result 37682 states and 58405 transitions. [2024-11-07 01:49:30,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:49:30,179 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:49:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:30,257 INFO L225 Difference]: With dead ends: 37682 [2024-11-07 01:49:30,257 INFO L226 Difference]: Without dead ends: 28035 [2024-11-07 01:49:30,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:49:30,286 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1290 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 3118 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 3181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:30,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1305 Valid, 2139 Invalid, 3181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3118 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-07 01:49:30,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2024-11-07 01:49:31,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 18986. [2024-11-07 01:49:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18986 states, 17418 states have (on average 1.5115971983006085) internal successors, (26329), 17484 states have internal predecessors, (26329), 1113 states have call successors, (1113), 391 states have call predecessors, (1113), 454 states have return successors, (1904), 1174 states have call predecessors, (1904), 1111 states have call successors, (1904) [2024-11-07 01:49:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18986 states to 18986 states and 29346 transitions. [2024-11-07 01:49:31,321 INFO L78 Accepts]: Start accepts. Automaton has 18986 states and 29346 transitions. Word has length 146 [2024-11-07 01:49:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:31,322 INFO L471 AbstractCegarLoop]: Abstraction has 18986 states and 29346 transitions. [2024-11-07 01:49:31,322 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:49:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 18986 states and 29346 transitions. [2024-11-07 01:49:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:49:31,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:31,329 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:49:31,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:49:31,329 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:31,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:31,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1085993567, now seen corresponding path program 1 times [2024-11-07 01:49:31,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:31,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880420597] [2024-11-07 01:49:31,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:31,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:31,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:49:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:31,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:49:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:31,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:49:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:31,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:49:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:31,469 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:49:31,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:31,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880420597] [2024-11-07 01:49:31,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880420597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:31,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:31,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:31,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936674450] [2024-11-07 01:49:31,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:31,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:31,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:31,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:31,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:31,471 INFO L87 Difference]: Start difference. First operand 18986 states and 29346 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:49:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:36,596 INFO L93 Difference]: Finished difference Result 73353 states and 114551 transitions. [2024-11-07 01:49:36,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:49:36,596 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:49:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:36,884 INFO L225 Difference]: With dead ends: 73353 [2024-11-07 01:49:36,884 INFO L226 Difference]: Without dead ends: 54385 [2024-11-07 01:49:36,954 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:49:36,954 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1468 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 2602 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:36,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 2139 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2602 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:49:36,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54385 states. [2024-11-07 01:49:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54385 to 37595. [2024-11-07 01:49:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37595 states, 34555 states have (on average 1.512342642164665) internal successors, (52259), 34685 states have internal predecessors, (52259), 2137 states have call successors, (2137), 775 states have call predecessors, (2137), 902 states have return successors, (4450), 2262 states have call predecessors, (4450), 2135 states have call successors, (4450) [2024-11-07 01:49:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37595 states to 37595 states and 58846 transitions. [2024-11-07 01:49:39,384 INFO L78 Accepts]: Start accepts. Automaton has 37595 states and 58846 transitions. Word has length 146 [2024-11-07 01:49:39,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:39,385 INFO L471 AbstractCegarLoop]: Abstraction has 37595 states and 58846 transitions. [2024-11-07 01:49:39,385 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:49:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 37595 states and 58846 transitions. [2024-11-07 01:49:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:49:39,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:39,401 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:49:39,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 01:49:39,401 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:39,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:39,401 INFO L85 PathProgramCache]: Analyzing trace with hash 641151395, now seen corresponding path program 1 times [2024-11-07 01:49:39,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:39,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401654941] [2024-11-07 01:49:39,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:39,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:39,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:39,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:49:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:39,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:49:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:39,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:49:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:39,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:49:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:39,562 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:49:39,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:39,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401654941] [2024-11-07 01:49:39,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401654941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:39,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:39,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:39,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953999120] [2024-11-07 01:49:39,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:39,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:39,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:39,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:39,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:39,564 INFO L87 Difference]: Start difference. First operand 37595 states and 58846 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:49:47,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:47,294 INFO L93 Difference]: Finished difference Result 143512 states and 226901 transitions. [2024-11-07 01:49:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:49:47,298 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:49:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:47,686 INFO L225 Difference]: With dead ends: 143512 [2024-11-07 01:49:47,686 INFO L226 Difference]: Without dead ends: 105935 [2024-11-07 01:49:47,793 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:49:47,795 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1434 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 2584 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 2648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:47,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1460 Valid, 2139 Invalid, 2648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2584 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:49:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105935 states. [2024-11-07 01:49:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105935 to 74748. [2024-11-07 01:49:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74748 states, 68828 states have (on average 1.5136427035508804) internal successors, (104181), 69086 states have internal predecessors, (104181), 4121 states have call successors, (4121), 1543 states have call predecessors, (4121), 1798 states have return successors, (10936), 4374 states have call predecessors, (10936), 4119 states have call successors, (10936) [2024-11-07 01:49:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74748 states to 74748 states and 119238 transitions. [2024-11-07 01:49:52,512 INFO L78 Accepts]: Start accepts. Automaton has 74748 states and 119238 transitions. Word has length 146 [2024-11-07 01:49:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:52,513 INFO L471 AbstractCegarLoop]: Abstraction has 74748 states and 119238 transitions. [2024-11-07 01:49:52,513 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:49:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 74748 states and 119238 transitions. [2024-11-07 01:49:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 01:49:52,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:52,539 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:49:52,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 01:49:52,539 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:52,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:52,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1112507745, now seen corresponding path program 1 times [2024-11-07 01:49:52,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:52,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251991741] [2024-11-07 01:49:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:52,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:52,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:52,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:49:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:52,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:49:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:52,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:49:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:52,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:49:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:52,859 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:49:52,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:52,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251991741] [2024-11-07 01:49:52,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251991741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:52,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:52,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:52,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463027347] [2024-11-07 01:49:52,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:52,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:52,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:52,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:52,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:52,861 INFO L87 Difference]: Start difference. First operand 74748 states and 119238 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:50:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:50:05,301 INFO L93 Difference]: Finished difference Result 277621 states and 448023 transitions. [2024-11-07 01:50:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:50:05,302 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:50:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:50:06,150 INFO L225 Difference]: With dead ends: 277621 [2024-11-07 01:50:06,151 INFO L226 Difference]: Without dead ends: 202891 [2024-11-07 01:50:06,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:50:06,608 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 1424 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 2223 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:50:06,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 1372 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2223 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:50:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202891 states.