./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.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', '8b411c6ac71505d2c5059a06fd3211eebca89561d9ac8be37f9ecc9ff82a7a16'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.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 8b411c6ac71505d2c5059a06fd3211eebca89561d9ac8be37f9ecc9ff82a7a16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:44:56,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:44:56,176 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:44:56,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:44:56,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:44:56,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:44:56,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:44:56,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:44:56,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:44:56,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:44:56,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:44:56,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:44:56,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:44:56,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:44:56,214 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:44:56,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:44:56,214 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:44:56,214 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:44:56,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:44:56,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:44:56,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:44:56,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:44:56,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:44:56,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:44:56,215 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:44:56,215 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:44:56,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:44:56,215 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:44:56,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:44:56,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:44:56,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:44:56,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:44:56,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:44:56,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:44:56,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:44:56,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:44:56,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:44:56,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:44:56,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:44:56,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:44:56,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:44:56,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:44:56,218 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 -> 8b411c6ac71505d2c5059a06fd3211eebca89561d9ac8be37f9ecc9ff82a7a16 [2024-11-07 01:44:56,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:44:56,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:44:56,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:44:56,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:44:56,548 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:44:56,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c [2024-11-07 01:44:57,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:44:58,186 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:44:58,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c [2024-11-07 01:44:58,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc1c84226/cf5eabef856b4546a61a9e98945b045a/FLAGd2ce5b354 [2024-11-07 01:44:58,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc1c84226/cf5eabef856b4546a61a9e98945b045a [2024-11-07 01:44:58,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:44:58,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:44:58,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:44:58,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:44:58,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:44:58,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:44:58" (1/1) ... [2024-11-07 01:44:58,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e10ccaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:58, skipping insertion in model container [2024-11-07 01:44:58,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:44:58" (1/1) ... [2024-11-07 01:44:58,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:44:58,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c[914,927] [2024-11-07 01:44:58,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c[7115,7128] [2024-11-07 01:44:58,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:44:58,732 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:44:58,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c[914,927] [2024-11-07 01:44:58,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c[7115,7128] [2024-11-07 01:44:58,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:44:58,827 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:44:58,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:58 WrapperNode [2024-11-07 01:44:58,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:44:58,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:44:58,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:44:58,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:44:58,835 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:44:58" (1/1) ... [2024-11-07 01:44:58,847 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:44:58" (1/1) ... [2024-11-07 01:44:58,886 INFO L138 Inliner]: procedures = 63, calls = 73, calls flagged for inlining = 31, calls inlined = 31, statements flattened = 654 [2024-11-07 01:44:58,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:44:58,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:44:58,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:44:58,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:44:58,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:58" (1/1) ... [2024-11-07 01:44:58,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:58" (1/1) ... [2024-11-07 01:44:58,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:58" (1/1) ... [2024-11-07 01:44:58,920 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:44:58,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:58" (1/1) ... [2024-11-07 01:44:58,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:58" (1/1) ... [2024-11-07 01:44:58,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:58" (1/1) ... [2024-11-07 01:44:58,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:58" (1/1) ... [2024-11-07 01:44:58,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:58" (1/1) ... [2024-11-07 01:44:58,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:58" (1/1) ... [2024-11-07 01:44:58,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:44:58,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:44:58,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:44:58,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:44:58,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:58" (1/1) ... [2024-11-07 01:44:58,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:44:58,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:44:59,004 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:44:59,011 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:44:59,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:44:59,034 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:44:59,034 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:44:59,034 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-07 01:44:59,034 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-07 01:44:59,034 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:44:59,035 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:44:59,035 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:44:59,035 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:44:59,035 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-07 01:44:59,035 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-07 01:44:59,035 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:44:59,035 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:44:59,035 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:44:59,036 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:44:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-07 01:44:59,036 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-07 01:44:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-07 01:44:59,036 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-07 01:44:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-07 01:44:59,037 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-07 01:44:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:44:59,037 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:44:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:44:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:44:59,037 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:44:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-07 01:44:59,037 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-07 01:44:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:44:59,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:44:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:44:59,037 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:44:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-07 01:44:59,037 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-07 01:44:59,173 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:44:59,175 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:44:59,887 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-11-07 01:44:59,887 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:44:59,915 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:44:59,916 INFO L316 CfgBuilder]: Removed 12 assume(true) statements. [2024-11-07 01:44:59,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:44:59 BoogieIcfgContainer [2024-11-07 01:44:59,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:44:59,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:44:59,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:44:59,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:44:59,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:44:58" (1/3) ... [2024-11-07 01:44:59,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7e112a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:44:59, skipping insertion in model container [2024-11-07 01:44:59,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:58" (2/3) ... [2024-11-07 01:44:59,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7e112a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:44:59, skipping insertion in model container [2024-11-07 01:44:59,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:44:59" (3/3) ... [2024-11-07 01:44:59,929 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.05.cil-2.c [2024-11-07 01:44:59,942 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:44:59,942 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:44:59,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:45:00,012 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;@221adc49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:45:00,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:45:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 322 states, 269 states have (on average 1.5910780669144982) internal successors, (428), 277 states have internal predecessors, (428), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-07 01:45:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:00,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:00,029 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:45:00,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:00,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:00,033 INFO L85 PathProgramCache]: Analyzing trace with hash 367022757, now seen corresponding path program 1 times [2024-11-07 01:45:00,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:00,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728103721] [2024-11-07 01:45:00,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:00,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,513 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:45:00,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:00,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728103721] [2024-11-07 01:45:00,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728103721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:00,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:00,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:00,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543028573] [2024-11-07 01:45:00,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:00,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:00,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:00,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:00,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:00,575 INFO L87 Difference]: Start difference. First operand has 322 states, 269 states have (on average 1.5910780669144982) internal successors, (428), 277 states have internal predecessors, (428), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) 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:45:01,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:01,433 INFO L93 Difference]: Finished difference Result 640 states and 989 transitions. [2024-11-07 01:45:01,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 01:45:01,436 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:45:01,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:01,451 INFO L225 Difference]: With dead ends: 640 [2024-11-07 01:45:01,451 INFO L226 Difference]: Without dead ends: 329 [2024-11-07 01:45:01,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:45:01,462 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 644 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:01,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 889 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:45:01,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-07 01:45:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 311. [2024-11-07 01:45:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 261 states have (on average 1.4980842911877394) internal successors, (391), 266 states have internal predecessors, (391), 35 states have call successors, (35), 15 states have call predecessors, (35), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 01:45:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 457 transitions. [2024-11-07 01:45:01,550 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 457 transitions. Word has length 65 [2024-11-07 01:45:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:01,550 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 457 transitions. [2024-11-07 01:45:01,551 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:45:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 457 transitions. [2024-11-07 01:45:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:01,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:01,557 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:45:01,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:45:01,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:01,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:01,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1019762653, now seen corresponding path program 1 times [2024-11-07 01:45:01,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:01,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638145626] [2024-11-07 01:45:01,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:01,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,883 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:45:01,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:01,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638145626] [2024-11-07 01:45:01,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638145626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:01,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:01,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:01,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005738130] [2024-11-07 01:45:01,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:01,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:01,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:01,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:01,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:01,887 INFO L87 Difference]: Start difference. First operand 311 states and 457 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:45:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:02,927 INFO L93 Difference]: Finished difference Result 534 states and 771 transitions. [2024-11-07 01:45:02,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:02,928 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:45:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:02,932 INFO L225 Difference]: With dead ends: 534 [2024-11-07 01:45:02,933 INFO L226 Difference]: Without dead ends: 446 [2024-11-07 01:45:02,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:02,935 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 796 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:02,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 1346 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:45:02,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-07 01:45:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 407. [2024-11-07 01:45:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 337 states have (on average 1.4688427299703264) internal successors, (495), 344 states have internal predecessors, (495), 46 states have call successors, (46), 22 states have call predecessors, (46), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2024-11-07 01:45:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 588 transitions. [2024-11-07 01:45:02,975 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 588 transitions. Word has length 65 [2024-11-07 01:45:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:02,976 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 588 transitions. [2024-11-07 01:45:02,977 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:45:02,977 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 588 transitions. [2024-11-07 01:45:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:02,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:02,980 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:45:02,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:45:02,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:02,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:02,983 INFO L85 PathProgramCache]: Analyzing trace with hash 659125987, now seen corresponding path program 1 times [2024-11-07 01:45:02,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:02,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335423065] [2024-11-07 01:45:02,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:02,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,225 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:45:03,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:03,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335423065] [2024-11-07 01:45:03,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335423065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:03,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:03,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:03,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289586216] [2024-11-07 01:45:03,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:03,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:03,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:03,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:03,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:03,227 INFO L87 Difference]: Start difference. First operand 407 states and 588 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:45:04,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:04,336 INFO L93 Difference]: Finished difference Result 754 states and 1064 transitions. [2024-11-07 01:45:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:45:04,337 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:45:04,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:04,342 INFO L225 Difference]: With dead ends: 754 [2024-11-07 01:45:04,342 INFO L226 Difference]: Without dead ends: 577 [2024-11-07 01:45:04,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:45:04,345 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1079 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:04,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 1379 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:45:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-07 01:45:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 503. [2024-11-07 01:45:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 413 states have (on average 1.4479418886198547) internal successors, (598), 422 states have internal predecessors, (598), 57 states have call successors, (57), 29 states have call predecessors, (57), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2024-11-07 01:45:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 721 transitions. [2024-11-07 01:45:04,435 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 721 transitions. Word has length 65 [2024-11-07 01:45:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:04,436 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 721 transitions. [2024-11-07 01:45:04,436 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:45:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 721 transitions. [2024-11-07 01:45:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:04,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:04,441 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:45:04,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:45:04,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:04,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1369460123, now seen corresponding path program 1 times [2024-11-07 01:45:04,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:04,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627986108] [2024-11-07 01:45:04,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:04,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,665 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:45:04,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:04,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627986108] [2024-11-07 01:45:04,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627986108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:04,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:04,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:04,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911702508] [2024-11-07 01:45:04,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:04,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:04,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:04,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:04,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:04,667 INFO L87 Difference]: Start difference. First operand 503 states and 721 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:05,596 INFO L93 Difference]: Finished difference Result 802 states and 1132 transitions. [2024-11-07 01:45:05,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:05,596 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-07 01:45:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:05,603 INFO L225 Difference]: With dead ends: 802 [2024-11-07 01:45:05,603 INFO L226 Difference]: Without dead ends: 535 [2024-11-07 01:45:05,605 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:45:05,608 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 549 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:05,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1656 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:45:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-07 01:45:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 508. [2024-11-07 01:45:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 417 states have (on average 1.4388489208633093) internal successors, (600), 426 states have internal predecessors, (600), 57 states have call successors, (57), 29 states have call predecessors, (57), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2024-11-07 01:45:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 724 transitions. [2024-11-07 01:45:05,655 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 724 transitions. Word has length 65 [2024-11-07 01:45:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:05,656 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 724 transitions. [2024-11-07 01:45:05,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 724 transitions. [2024-11-07 01:45:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:05,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:05,659 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:45:05,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:45:05,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:05,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:05,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1896147875, now seen corresponding path program 1 times [2024-11-07 01:45:05,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:05,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291163552] [2024-11-07 01:45:05,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:05,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,838 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:45:05,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:05,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291163552] [2024-11-07 01:45:05,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291163552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:05,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:05,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:05,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855906765] [2024-11-07 01:45:05,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:05,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:05,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:05,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:05,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:05,840 INFO L87 Difference]: Start difference. First operand 508 states and 724 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:06,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:06,783 INFO L93 Difference]: Finished difference Result 824 states and 1154 transitions. [2024-11-07 01:45:06,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:45:06,784 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-07 01:45:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:06,788 INFO L225 Difference]: With dead ends: 824 [2024-11-07 01:45:06,789 INFO L226 Difference]: Without dead ends: 552 [2024-11-07 01:45:06,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:06,793 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 555 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:06,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1655 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:45:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-07 01:45:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 523. [2024-11-07 01:45:06,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 429 states have (on average 1.4265734265734267) internal successors, (612), 438 states have internal predecessors, (612), 57 states have call successors, (57), 29 states have call predecessors, (57), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2024-11-07 01:45:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 739 transitions. [2024-11-07 01:45:06,847 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 739 transitions. Word has length 65 [2024-11-07 01:45:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:06,848 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 739 transitions. [2024-11-07 01:45:06,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 739 transitions. [2024-11-07 01:45:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:06,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:06,849 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:45:06,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:45:06,850 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:06,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:06,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1012616027, now seen corresponding path program 1 times [2024-11-07 01:45:06,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:06,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057990591] [2024-11-07 01:45:06,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:06,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,080 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:45:07,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:07,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057990591] [2024-11-07 01:45:07,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057990591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:07,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:07,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:07,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422226701] [2024-11-07 01:45:07,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:07,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:07,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:07,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:07,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:07,081 INFO L87 Difference]: Start difference. First operand 523 states and 739 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:45:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:08,079 INFO L93 Difference]: Finished difference Result 915 states and 1250 transitions. [2024-11-07 01:45:08,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:45:08,080 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:45:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:08,084 INFO L225 Difference]: With dead ends: 915 [2024-11-07 01:45:08,084 INFO L226 Difference]: Without dead ends: 630 [2024-11-07 01:45:08,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:45:08,087 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 1105 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:08,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 1190 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:45:08,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-07 01:45:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 535. [2024-11-07 01:45:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 439 states have (on average 1.4168564920273348) internal successors, (622), 448 states have internal predecessors, (622), 58 states have call successors, (58), 30 states have call predecessors, (58), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2024-11-07 01:45:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 749 transitions. [2024-11-07 01:45:08,147 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 749 transitions. Word has length 65 [2024-11-07 01:45:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:08,148 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 749 transitions. [2024-11-07 01:45:08,148 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:45:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 749 transitions. [2024-11-07 01:45:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:08,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:08,149 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:45:08,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:45:08,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:08,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:08,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1146629533, now seen corresponding path program 1 times [2024-11-07 01:45:08,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:08,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773582678] [2024-11-07 01:45:08,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:08,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,280 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:45:08,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:08,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773582678] [2024-11-07 01:45:08,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773582678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:08,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:08,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:08,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650770965] [2024-11-07 01:45:08,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:08,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:08,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:08,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:08,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:08,282 INFO L87 Difference]: Start difference. First operand 535 states and 749 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:08,942 INFO L93 Difference]: Finished difference Result 1177 states and 1593 transitions. [2024-11-07 01:45:08,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:45:08,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-07 01:45:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:08,948 INFO L225 Difference]: With dead ends: 1177 [2024-11-07 01:45:08,948 INFO L226 Difference]: Without dead ends: 881 [2024-11-07 01:45:08,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:45:08,950 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1083 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:08,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 925 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-07 01:45:08,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 825. [2024-11-07 01:45:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 663 states have (on average 1.3665158371040724) internal successors, (906), 679 states have internal predecessors, (906), 93 states have call successors, (93), 52 states have call predecessors, (93), 67 states have return successors, (126), 100 states have call predecessors, (126), 89 states have call successors, (126) [2024-11-07 01:45:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1125 transitions. [2024-11-07 01:45:09,004 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1125 transitions. Word has length 65 [2024-11-07 01:45:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:09,004 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1125 transitions. [2024-11-07 01:45:09,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1125 transitions. [2024-11-07 01:45:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:45:09,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:09,007 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:45:09,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:45:09,007 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:09,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:09,008 INFO L85 PathProgramCache]: Analyzing trace with hash -502764948, now seen corresponding path program 1 times [2024-11-07 01:45:09,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:09,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648853223] [2024-11-07 01:45:09,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:09,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,103 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:45:09,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:09,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648853223] [2024-11-07 01:45:09,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648853223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:09,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:09,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:09,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147153123] [2024-11-07 01:45:09,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:09,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:09,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:09,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:09,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:09,106 INFO L87 Difference]: Start difference. First operand 825 states and 1125 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:09,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:09,832 INFO L93 Difference]: Finished difference Result 2028 states and 2692 transitions. [2024-11-07 01:45:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:09,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-07 01:45:09,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:09,841 INFO L225 Difference]: With dead ends: 2028 [2024-11-07 01:45:09,841 INFO L226 Difference]: Without dead ends: 1421 [2024-11-07 01:45:09,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:45:09,845 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 562 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:09,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1099 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:45:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2024-11-07 01:45:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1306. [2024-11-07 01:45:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1042 states have (on average 1.3330134357005758) internal successors, (1389), 1061 states have internal predecessors, (1389), 138 states have call successors, (138), 96 states have call predecessors, (138), 124 states have return successors, (198), 155 states have call predecessors, (198), 134 states have call successors, (198) [2024-11-07 01:45:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1725 transitions. [2024-11-07 01:45:09,950 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1725 transitions. Word has length 66 [2024-11-07 01:45:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:09,951 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 1725 transitions. [2024-11-07 01:45:09,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1725 transitions. [2024-11-07 01:45:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:45:09,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:09,958 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:45:09,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:45:09,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:09,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash 955474711, now seen corresponding path program 1 times [2024-11-07 01:45:09,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:09,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531081652] [2024-11-07 01:45:09,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:09,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:10,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:10,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:10,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:10,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:10,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:10,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:10,038 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:45:10,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:10,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531081652] [2024-11-07 01:45:10,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531081652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:10,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:10,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:10,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313579214] [2024-11-07 01:45:10,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:10,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:10,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:10,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:10,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:10,042 INFO L87 Difference]: Start difference. First operand 1306 states and 1725 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:10,769 INFO L93 Difference]: Finished difference Result 3494 states and 4531 transitions. [2024-11-07 01:45:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:45:10,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-07 01:45:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:10,785 INFO L225 Difference]: With dead ends: 3494 [2024-11-07 01:45:10,786 INFO L226 Difference]: Without dead ends: 2426 [2024-11-07 01:45:10,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:45:10,791 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 1087 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:10,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 727 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2024-11-07 01:45:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 2168. [2024-11-07 01:45:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 1708 states have (on average 1.2974238875878221) internal successors, (2216), 1737 states have internal predecessors, (2216), 236 states have call successors, (236), 180 states have call predecessors, (236), 222 states have return successors, (334), 257 states have call predecessors, (334), 232 states have call successors, (334) [2024-11-07 01:45:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 2786 transitions. [2024-11-07 01:45:11,002 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 2786 transitions. Word has length 66 [2024-11-07 01:45:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:11,003 INFO L471 AbstractCegarLoop]: Abstraction has 2168 states and 2786 transitions. [2024-11-07 01:45:11,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2786 transitions. [2024-11-07 01:45:11,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 01:45:11,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:11,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:11,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:45:11,007 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:11,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:11,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2043324725, now seen corresponding path program 1 times [2024-11-07 01:45:11,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:11,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913416048] [2024-11-07 01:45:11,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:11,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,094 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:45:11,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:11,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913416048] [2024-11-07 01:45:11,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913416048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:11,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:11,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:11,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295155253] [2024-11-07 01:45:11,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:11,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:11,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:11,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:11,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:11,095 INFO L87 Difference]: Start difference. First operand 2168 states and 2786 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:11,833 INFO L93 Difference]: Finished difference Result 5078 states and 6436 transitions. [2024-11-07 01:45:11,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:11,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-11-07 01:45:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:11,850 INFO L225 Difference]: With dead ends: 5078 [2024-11-07 01:45:11,850 INFO L226 Difference]: Without dead ends: 3148 [2024-11-07 01:45:11,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:45:11,856 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 1068 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:11,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 763 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:11,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2024-11-07 01:45:12,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 2900. [2024-11-07 01:45:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2276 states have (on average 1.2829525483304043) internal successors, (2920), 2313 states have internal predecessors, (2920), 316 states have call successors, (316), 250 states have call predecessors, (316), 306 states have return successors, (443), 343 states have call predecessors, (443), 312 states have call successors, (443) [2024-11-07 01:45:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3679 transitions. [2024-11-07 01:45:12,086 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3679 transitions. Word has length 72 [2024-11-07 01:45:12,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:12,087 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 3679 transitions. [2024-11-07 01:45:12,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3679 transitions. [2024-11-07 01:45:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 01:45:12,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:12,089 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:12,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:45:12,090 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:12,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:12,090 INFO L85 PathProgramCache]: Analyzing trace with hash 564993281, now seen corresponding path program 1 times [2024-11-07 01:45:12,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:12,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413370976] [2024-11-07 01:45:12,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:12,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:12,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:12,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413370976] [2024-11-07 01:45:12,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413370976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:12,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:12,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:12,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759092426] [2024-11-07 01:45:12,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:12,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:12,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:12,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:12,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:12,221 INFO L87 Difference]: Start difference. First operand 2900 states and 3679 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 01:45:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:13,182 INFO L93 Difference]: Finished difference Result 3674 states and 4610 transitions. [2024-11-07 01:45:13,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:45:13,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2024-11-07 01:45:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:13,203 INFO L225 Difference]: With dead ends: 3674 [2024-11-07 01:45:13,204 INFO L226 Difference]: Without dead ends: 3671 [2024-11-07 01:45:13,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:45:13,206 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1525 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1535 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:13,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1535 Valid, 739 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:45:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2024-11-07 01:45:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3394. [2024-11-07 01:45:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3394 states, 2661 states have (on average 1.2747087561067267) internal successors, (3392), 2703 states have internal predecessors, (3392), 366 states have call successors, (366), 294 states have call predecessors, (366), 365 states have return successors, (522), 403 states have call predecessors, (522), 363 states have call successors, (522) [2024-11-07 01:45:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 4280 transitions. [2024-11-07 01:45:13,506 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 4280 transitions. Word has length 73 [2024-11-07 01:45:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:13,506 INFO L471 AbstractCegarLoop]: Abstraction has 3394 states and 4280 transitions. [2024-11-07 01:45:13,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 01:45:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 4280 transitions. [2024-11-07 01:45:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 01:45:13,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:13,510 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:13,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:45:13,510 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:13,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash 333968853, now seen corresponding path program 1 times [2024-11-07 01:45:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:13,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091246583] [2024-11-07 01:45:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:13,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:13,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:13,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091246583] [2024-11-07 01:45:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091246583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:45:13,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517076561] [2024-11-07 01:45:13,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:13,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:45:13,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:45:13,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:45:13,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 01:45:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 01:45:13,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:45:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:14,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:45:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:14,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517076561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:45:14,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:45:14,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-07 01:45:14,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699665903] [2024-11-07 01:45:14,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:45:14,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:45:14,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:14,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:45:14,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:45:14,274 INFO L87 Difference]: Start difference. First operand 3394 states and 4280 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-07 01:45:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:16,447 INFO L93 Difference]: Finished difference Result 7835 states and 9766 transitions. [2024-11-07 01:45:16,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 01:45:16,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2024-11-07 01:45:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:16,489 INFO L225 Difference]: With dead ends: 7835 [2024-11-07 01:45:16,489 INFO L226 Difference]: Without dead ends: 7832 [2024-11-07 01:45:16,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-11-07 01:45:16,495 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 2067 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:16,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 1460 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:45:16,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7832 states. [2024-11-07 01:45:16,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7832 to 5184. [2024-11-07 01:45:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5184 states, 4065 states have (on average 1.2713407134071342) internal successors, (5168), 4129 states have internal predecessors, (5168), 550 states have call successors, (550), 452 states have call predecessors, (550), 567 states have return successors, (800), 609 states have call predecessors, (800), 547 states have call successors, (800) [2024-11-07 01:45:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 6518 transitions. [2024-11-07 01:45:17,030 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 6518 transitions. Word has length 74 [2024-11-07 01:45:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:17,031 INFO L471 AbstractCegarLoop]: Abstraction has 5184 states and 6518 transitions. [2024-11-07 01:45:17,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-07 01:45:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 6518 transitions. [2024-11-07 01:45:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 01:45:17,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:17,034 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:17,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 01:45:17,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 01:45:17,235 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:17,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:17,235 INFO L85 PathProgramCache]: Analyzing trace with hash 976546945, now seen corresponding path program 2 times [2024-11-07 01:45:17,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:17,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905016234] [2024-11-07 01:45:17,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:17,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:17,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:17,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:17,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:17,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:17,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:17,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:17,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:17,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:17,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905016234] [2024-11-07 01:45:17,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905016234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:17,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:17,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:17,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051654335] [2024-11-07 01:45:17,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:17,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:17,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:17,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:17,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:17,315 INFO L87 Difference]: Start difference. First operand 5184 states and 6518 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 01:45:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:18,304 INFO L93 Difference]: Finished difference Result 7866 states and 9891 transitions. [2024-11-07 01:45:18,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:45:18,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2024-11-07 01:45:18,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:18,328 INFO L225 Difference]: With dead ends: 7866 [2024-11-07 01:45:18,329 INFO L226 Difference]: Without dead ends: 3791 [2024-11-07 01:45:18,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:45:18,342 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 775 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:18,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1064 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:18,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3791 states. [2024-11-07 01:45:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3791 to 3556. [2024-11-07 01:45:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3556 states, 2793 states have (on average 1.2559971356963837) internal successors, (3508), 2835 states have internal predecessors, (3508), 382 states have call successors, (382), 308 states have call predecessors, (382), 379 states have return successors, (526), 419 states have call predecessors, (526), 379 states have call successors, (526) [2024-11-07 01:45:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3556 states and 4416 transitions. [2024-11-07 01:45:18,865 INFO L78 Accepts]: Start accepts. Automaton has 3556 states and 4416 transitions. Word has length 77 [2024-11-07 01:45:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:18,866 INFO L471 AbstractCegarLoop]: Abstraction has 3556 states and 4416 transitions. [2024-11-07 01:45:18,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 01:45:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 4416 transitions. [2024-11-07 01:45:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 01:45:18,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:18,870 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:18,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:45:18,870 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:18,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:18,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1383113145, now seen corresponding path program 1 times [2024-11-07 01:45:18,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:18,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877243041] [2024-11-07 01:45:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:18,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 01:45:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 01:45:19,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:19,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877243041] [2024-11-07 01:45:19,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877243041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:19,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:19,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:19,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15968971] [2024-11-07 01:45:19,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:19,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:19,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:19,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:19,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:19,002 INFO L87 Difference]: Start difference. First operand 3556 states and 4416 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 01:45:20,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:20,649 INFO L93 Difference]: Finished difference Result 10412 states and 12797 transitions. [2024-11-07 01:45:20,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 01:45:20,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2024-11-07 01:45:20,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:20,680 INFO L225 Difference]: With dead ends: 10412 [2024-11-07 01:45:20,680 INFO L226 Difference]: Without dead ends: 5791 [2024-11-07 01:45:20,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-07 01:45:20,692 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 788 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:20,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1451 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:45:20,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5791 states. [2024-11-07 01:45:21,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5791 to 5471. [2024-11-07 01:45:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5471 states, 4251 states have (on average 1.2314749470712774) internal successors, (5235), 4336 states have internal predecessors, (5235), 586 states have call successors, (586), 482 states have call predecessors, (586), 632 states have return successors, (908), 659 states have call predecessors, (908), 583 states have call successors, (908) [2024-11-07 01:45:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 6729 transitions. [2024-11-07 01:45:21,278 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 6729 transitions. Word has length 84 [2024-11-07 01:45:21,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:21,279 INFO L471 AbstractCegarLoop]: Abstraction has 5471 states and 6729 transitions. [2024-11-07 01:45:21,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 01:45:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 6729 transitions. [2024-11-07 01:45:21,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 01:45:21,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:21,284 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:21,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:45:21,285 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:21,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1185637441, now seen corresponding path program 1 times [2024-11-07 01:45:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:21,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651462805] [2024-11-07 01:45:21,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:21,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:21,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:21,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:21,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:21,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:21,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:21,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:21,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:21,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:45:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 01:45:21,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:21,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651462805] [2024-11-07 01:45:21,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651462805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:21,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:21,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:21,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814524773] [2024-11-07 01:45:21,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:21,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:21,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:21,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:21,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:21,440 INFO L87 Difference]: Start difference. First operand 5471 states and 6729 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 01:45:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:22,925 INFO L93 Difference]: Finished difference Result 9474 states and 11569 transitions. [2024-11-07 01:45:22,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 01:45:22,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2024-11-07 01:45:22,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:22,951 INFO L225 Difference]: With dead ends: 9474 [2024-11-07 01:45:22,951 INFO L226 Difference]: Without dead ends: 4881 [2024-11-07 01:45:22,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-11-07 01:45:22,965 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 1748 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1787 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:22,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1787 Valid, 1267 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:45:22,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4881 states. [2024-11-07 01:45:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4881 to 4547. [2024-11-07 01:45:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4547 states, 3540 states have (on average 1.2242937853107345) internal successors, (4334), 3607 states have internal predecessors, (4334), 487 states have call successors, (487), 397 states have call predecessors, (487), 518 states have return successors, (686), 549 states have call predecessors, (686), 484 states have call successors, (686) [2024-11-07 01:45:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4547 states to 4547 states and 5507 transitions. [2024-11-07 01:45:23,512 INFO L78 Accepts]: Start accepts. Automaton has 4547 states and 5507 transitions. Word has length 93 [2024-11-07 01:45:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:23,513 INFO L471 AbstractCegarLoop]: Abstraction has 4547 states and 5507 transitions. [2024-11-07 01:45:23,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 01:45:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 4547 states and 5507 transitions. [2024-11-07 01:45:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 01:45:23,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:23,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:23,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:45:23,518 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:23,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:23,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2129567276, now seen corresponding path program 1 times [2024-11-07 01:45:23,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:23,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727085315] [2024-11-07 01:45:23,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:23,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:23,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727085315] [2024-11-07 01:45:23,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727085315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:23,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:23,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:45:23,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619034088] [2024-11-07 01:45:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:23,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:45:23,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:23,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:45:23,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:45:23,633 INFO L87 Difference]: Start difference. First operand 4547 states and 5507 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (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:45:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:24,854 INFO L93 Difference]: Finished difference Result 4817 states and 5929 transitions. [2024-11-07 01:45:24,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:45:24,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (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 102 [2024-11-07 01:45:24,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:24,871 INFO L225 Difference]: With dead ends: 4817 [2024-11-07 01:45:24,871 INFO L226 Difference]: Without dead ends: 4612 [2024-11-07 01:45:24,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:24,874 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 631 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:24,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 687 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:45:24,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4612 states. [2024-11-07 01:45:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4612 to 4547. [2024-11-07 01:45:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4547 states, 3540 states have (on average 1.2240112994350283) internal successors, (4333), 3607 states have internal predecessors, (4333), 487 states have call successors, (487), 397 states have call predecessors, (487), 518 states have return successors, (686), 549 states have call predecessors, (686), 484 states have call successors, (686) [2024-11-07 01:45:25,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4547 states to 4547 states and 5506 transitions. [2024-11-07 01:45:25,505 INFO L78 Accepts]: Start accepts. Automaton has 4547 states and 5506 transitions. Word has length 102 [2024-11-07 01:45:25,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:25,506 INFO L471 AbstractCegarLoop]: Abstraction has 4547 states and 5506 transitions. [2024-11-07 01:45:25,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (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:45:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 4547 states and 5506 transitions. [2024-11-07 01:45:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 01:45:25,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:25,510 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] [2024-11-07 01:45:25,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:45:25,511 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:25,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:25,511 INFO L85 PathProgramCache]: Analyzing trace with hash 288336790, now seen corresponding path program 1 times [2024-11-07 01:45:25,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:25,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965158302] [2024-11-07 01:45:25,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:25,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,649 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:45:25,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:25,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965158302] [2024-11-07 01:45:25,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965158302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:25,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:25,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:25,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307826342] [2024-11-07 01:45:25,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:25,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:25,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:25,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:25,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:25,652 INFO L87 Difference]: Start difference. First operand 4547 states and 5506 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (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:45:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:27,570 INFO L93 Difference]: Finished difference Result 5085 states and 6349 transitions. [2024-11-07 01:45:27,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:27,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (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 102 [2024-11-07 01:45:27,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:27,591 INFO L225 Difference]: With dead ends: 5085 [2024-11-07 01:45:27,591 INFO L226 Difference]: Without dead ends: 4883 [2024-11-07 01:45:27,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:45:27,595 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1000 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:27,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 978 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:45:27,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2024-11-07 01:45:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 4752. [2024-11-07 01:45:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4752 states, 3724 states have (on average 1.2400644468313642) internal successors, (4618), 3792 states have internal predecessors, (4618), 501 states have call successors, (501), 403 states have call predecessors, (501), 525 states have return successors, (703), 563 states have call predecessors, (703), 498 states have call successors, (703) [2024-11-07 01:45:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 5822 transitions. [2024-11-07 01:45:28,230 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 5822 transitions. Word has length 102 [2024-11-07 01:45:28,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:28,231 INFO L471 AbstractCegarLoop]: Abstraction has 4752 states and 5822 transitions. [2024-11-07 01:45:28,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (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:45:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 5822 transitions. [2024-11-07 01:45:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 01:45:28,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:28,235 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] [2024-11-07 01:45:28,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:45:28,235 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:28,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:28,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1670237996, now seen corresponding path program 1 times [2024-11-07 01:45:28,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:28,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717429347] [2024-11-07 01:45:28,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:28,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,389 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:45:28,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:28,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717429347] [2024-11-07 01:45:28,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717429347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:28,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:28,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:28,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742005133] [2024-11-07 01:45:28,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:28,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:28,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:28,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:28,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:28,391 INFO L87 Difference]: Start difference. First operand 4752 states and 5822 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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:45:31,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:31,038 INFO L93 Difference]: Finished difference Result 5567 states and 7098 transitions. [2024-11-07 01:45:31,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:31,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 102 [2024-11-07 01:45:31,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:31,068 INFO L225 Difference]: With dead ends: 5567 [2024-11-07 01:45:31,068 INFO L226 Difference]: Without dead ends: 5160 [2024-11-07 01:45:31,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:45:31,074 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 1011 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:31,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1722 Invalid, 2079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:45:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5160 states. [2024-11-07 01:45:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5160 to 4945. [2024-11-07 01:45:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4945 states, 3896 states have (on average 1.2523100616016427) internal successors, (4879), 3965 states have internal predecessors, (4879), 515 states have call successors, (515), 409 states have call predecessors, (515), 532 states have return successors, (719), 578 states have call predecessors, (719), 512 states have call successors, (719) [2024-11-07 01:45:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6113 transitions. [2024-11-07 01:45:31,739 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6113 transitions. Word has length 102 [2024-11-07 01:45:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:31,740 INFO L471 AbstractCegarLoop]: Abstraction has 4945 states and 6113 transitions. [2024-11-07 01:45:31,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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:45:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6113 transitions. [2024-11-07 01:45:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 01:45:31,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:31,747 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] [2024-11-07 01:45:31,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:45:31,747 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:31,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:31,748 INFO L85 PathProgramCache]: Analyzing trace with hash 745598354, now seen corresponding path program 1 times [2024-11-07 01:45:31,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:31,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598597587] [2024-11-07 01:45:31,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:31,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,902 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:45:31,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:31,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598597587] [2024-11-07 01:45:31,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598597587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:31,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:31,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:31,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911237634] [2024-11-07 01:45:31,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:31,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:31,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:31,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:31,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:31,905 INFO L87 Difference]: Start difference. First operand 4945 states and 6113 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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:45:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:34,274 INFO L93 Difference]: Finished difference Result 6275 states and 8189 transitions. [2024-11-07 01:45:34,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:34,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 102 [2024-11-07 01:45:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:34,296 INFO L225 Difference]: With dead ends: 6275 [2024-11-07 01:45:34,297 INFO L226 Difference]: Without dead ends: 5675 [2024-11-07 01:45:34,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:45:34,302 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 1006 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 2056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:34,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 1720 Invalid, 2056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:45:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5675 states. [2024-11-07 01:45:35,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5675 to 5334. [2024-11-07 01:45:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5334 states, 4243 states have (on average 1.2740985152015083) internal successors, (5406), 4314 states have internal predecessors, (5406), 543 states have call successors, (543), 421 states have call predecessors, (543), 546 states have return successors, (755), 608 states have call predecessors, (755), 540 states have call successors, (755) [2024-11-07 01:45:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5334 states to 5334 states and 6704 transitions. [2024-11-07 01:45:35,076 INFO L78 Accepts]: Start accepts. Automaton has 5334 states and 6704 transitions. Word has length 102 [2024-11-07 01:45:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:35,077 INFO L471 AbstractCegarLoop]: Abstraction has 5334 states and 6704 transitions. [2024-11-07 01:45:35,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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:45:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 5334 states and 6704 transitions. [2024-11-07 01:45:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 01:45:35,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:35,082 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] [2024-11-07 01:45:35,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:45:35,082 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:35,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:35,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2070454548, now seen corresponding path program 1 times [2024-11-07 01:45:35,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:35,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902151507] [2024-11-07 01:45:35,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:35,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,236 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:45:35,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:35,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902151507] [2024-11-07 01:45:35,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902151507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:35,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:35,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:35,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954243363] [2024-11-07 01:45:35,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:35,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:35,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:35,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:35,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:35,237 INFO L87 Difference]: Start difference. First operand 5334 states and 6704 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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:45:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:37,495 INFO L93 Difference]: Finished difference Result 7650 states and 10304 transitions. [2024-11-07 01:45:37,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:37,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 102 [2024-11-07 01:45:37,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:37,524 INFO L225 Difference]: With dead ends: 7650 [2024-11-07 01:45:37,525 INFO L226 Difference]: Without dead ends: 6661 [2024-11-07 01:45:37,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:45:37,532 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 1005 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:37,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 1720 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:45:37,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2024-11-07 01:45:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 6115. [2024-11-07 01:45:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6115 states, 4940 states have (on average 1.308502024291498) internal successors, (6464), 5015 states have internal predecessors, (6464), 599 states have call successors, (599), 445 states have call predecessors, (599), 574 states have return successors, (833), 668 states have call predecessors, (833), 596 states have call successors, (833) [2024-11-07 01:45:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6115 states to 6115 states and 7896 transitions. [2024-11-07 01:45:38,231 INFO L78 Accepts]: Start accepts. Automaton has 6115 states and 7896 transitions. Word has length 102 [2024-11-07 01:45:38,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:38,231 INFO L471 AbstractCegarLoop]: Abstraction has 6115 states and 7896 transitions. [2024-11-07 01:45:38,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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:45:38,231 INFO L276 IsEmpty]: Start isEmpty. Operand 6115 states and 7896 transitions. [2024-11-07 01:45:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 01:45:38,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:38,237 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] [2024-11-07 01:45:38,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:45:38,237 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:38,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:38,238 INFO L85 PathProgramCache]: Analyzing trace with hash -657754798, now seen corresponding path program 1 times [2024-11-07 01:45:38,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:38,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682536774] [2024-11-07 01:45:38,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:38,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,376 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:45:38,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:38,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682536774] [2024-11-07 01:45:38,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682536774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:38,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:38,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:38,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863291885] [2024-11-07 01:45:38,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:38,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:38,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:38,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:38,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:38,378 INFO L87 Difference]: Start difference. First operand 6115 states and 7896 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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:45:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:40,468 INFO L93 Difference]: Finished difference Result 10401 states and 14554 transitions. [2024-11-07 01:45:40,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:40,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 102 [2024-11-07 01:45:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:40,507 INFO L225 Difference]: With dead ends: 10401 [2024-11-07 01:45:40,507 INFO L226 Difference]: Without dead ends: 8631 [2024-11-07 01:45:40,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:45:40,519 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 1004 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 2030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:40,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1720 Invalid, 2030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1942 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:45:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8631 states. [2024-11-07 01:45:41,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8631 to 7684. [2024-11-07 01:45:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7684 states, 6341 states have (on average 1.3546759186248225) internal successors, (8590), 6424 states have internal predecessors, (8590), 711 states have call successors, (711), 493 states have call predecessors, (711), 630 states have return successors, (1007), 788 states have call predecessors, (1007), 708 states have call successors, (1007) [2024-11-07 01:45:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 10308 transitions. [2024-11-07 01:45:41,383 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 10308 transitions. Word has length 102 [2024-11-07 01:45:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:41,383 INFO L471 AbstractCegarLoop]: Abstraction has 7684 states and 10308 transitions. [2024-11-07 01:45:41,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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:45:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 10308 transitions. [2024-11-07 01:45:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 01:45:41,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:41,389 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] [2024-11-07 01:45:41,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 01:45:41,389 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:41,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:41,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1715592876, now seen corresponding path program 1 times [2024-11-07 01:45:41,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:41,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563492598] [2024-11-07 01:45:41,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:41,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,523 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:45:41,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:41,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563492598] [2024-11-07 01:45:41,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563492598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:41,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:41,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:41,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614495601] [2024-11-07 01:45:41,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:41,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:41,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:41,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:41,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:41,525 INFO L87 Difference]: Start difference. First operand 7684 states and 10308 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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:45:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:44,367 INFO L93 Difference]: Finished difference Result 17168 states and 25006 transitions. [2024-11-07 01:45:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:45:44,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 102 [2024-11-07 01:45:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:44,425 INFO L225 Difference]: With dead ends: 17168 [2024-11-07 01:45:44,425 INFO L226 Difference]: Without dead ends: 13829 [2024-11-07 01:45:44,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:44,442 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1056 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:44,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1710 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:45:44,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13829 states. [2024-11-07 01:45:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13829 to 10789. [2024-11-07 01:45:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10789 states, 9126 states have (on average 1.40609248301556) internal successors, (12832), 9225 states have internal predecessors, (12832), 919 states have call successors, (919), 589 states have call predecessors, (919), 742 states have return successors, (1393), 1012 states have call predecessors, (1393), 916 states have call successors, (1393) [2024-11-07 01:45:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10789 states to 10789 states and 15144 transitions. [2024-11-07 01:45:45,691 INFO L78 Accepts]: Start accepts. Automaton has 10789 states and 15144 transitions. Word has length 102 [2024-11-07 01:45:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:45,691 INFO L471 AbstractCegarLoop]: Abstraction has 10789 states and 15144 transitions. [2024-11-07 01:45:45,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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:45:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 10789 states and 15144 transitions. [2024-11-07 01:45:45,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 01:45:45,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:45,699 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] [2024-11-07 01:45:45,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 01:45:45,699 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:45,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:45,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1436871954, now seen corresponding path program 1 times [2024-11-07 01:45:45,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:45,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303161188] [2024-11-07 01:45:45,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:45,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,833 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:45:45,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:45,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303161188] [2024-11-07 01:45:45,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303161188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:45,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:45,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:45,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548778483] [2024-11-07 01:45:45,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:45,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:45,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:45,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:45,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:45,835 INFO L87 Difference]: Start difference. First operand 10789 states and 15144 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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:45:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:48,671 INFO L93 Difference]: Finished difference Result 28911 states and 43412 transitions. [2024-11-07 01:45:48,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:45:48,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 102 [2024-11-07 01:45:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:48,765 INFO L225 Difference]: With dead ends: 28911 [2024-11-07 01:45:48,765 INFO L226 Difference]: Without dead ends: 22467 [2024-11-07 01:45:48,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:48,793 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 1175 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:48,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 1706 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:45:48,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22467 states. [2024-11-07 01:45:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22467 to 16662. [2024-11-07 01:45:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16662 states, 14375 states have (on average 1.4437565217391304) internal successors, (20754), 14506 states have internal predecessors, (20754), 1319 states have call successors, (1319), 781 states have call predecessors, (1319), 966 states have return successors, (2311), 1444 states have call predecessors, (2311), 1316 states have call successors, (2311) [2024-11-07 01:45:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16662 states to 16662 states and 24384 transitions. [2024-11-07 01:45:50,448 INFO L78 Accepts]: Start accepts. Automaton has 16662 states and 24384 transitions. Word has length 102 [2024-11-07 01:45:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:50,449 INFO L471 AbstractCegarLoop]: Abstraction has 16662 states and 24384 transitions. [2024-11-07 01:45:50,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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:45:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 16662 states and 24384 transitions. [2024-11-07 01:45:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 01:45:50,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:50,458 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] [2024-11-07 01:45:50,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 01:45:50,459 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:50,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:50,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1677111700, now seen corresponding path program 1 times [2024-11-07 01:45:50,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:50,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633301220] [2024-11-07 01:45:50,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:50,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:50,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:50,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:50,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:50,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:50,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:50,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:45:50,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:50,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633301220] [2024-11-07 01:45:50,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633301220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:50,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:50,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:50,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622286810] [2024-11-07 01:45:50,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:50,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:50,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:50,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:50,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:50,599 INFO L87 Difference]: Start difference. First operand 16662 states and 24384 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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:45:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:54,133 INFO L93 Difference]: Finished difference Result 50846 states and 78170 transitions. [2024-11-07 01:45:54,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:45:54,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 102 [2024-11-07 01:45:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:54,315 INFO L225 Difference]: With dead ends: 50846 [2024-11-07 01:45:54,315 INFO L226 Difference]: Without dead ends: 38529 [2024-11-07 01:45:54,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:54,371 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1081 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 1896 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:54,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 1184 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1896 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:45:54,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38529 states. [2024-11-07 01:45:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38529 to 28695. [2024-11-07 01:45:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28695 states, 25192 states have (on average 1.4768180374722133) internal successors, (37204), 25387 states have internal predecessors, (37204), 2087 states have call successors, (2087), 1165 states have call predecessors, (2087), 1414 states have return successors, (4601), 2276 states have call predecessors, (4601), 2084 states have call successors, (4601) [2024-11-07 01:45:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28695 states to 28695 states and 43892 transitions. [2024-11-07 01:45:57,167 INFO L78 Accepts]: Start accepts. Automaton has 28695 states and 43892 transitions. Word has length 102 [2024-11-07 01:45:57,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:57,167 INFO L471 AbstractCegarLoop]: Abstraction has 28695 states and 43892 transitions. [2024-11-07 01:45:57,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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:45:57,167 INFO L276 IsEmpty]: Start isEmpty. Operand 28695 states and 43892 transitions. [2024-11-07 01:45:57,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 01:45:57,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:57,185 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] [2024-11-07 01:45:57,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 01:45:57,186 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:57,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:57,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1778821934, now seen corresponding path program 1 times [2024-11-07 01:45:57,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:57,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984860098] [2024-11-07 01:45:57,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:57,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:57,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:57,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:57,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:57,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:57,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:57,318 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:45:57,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:57,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984860098] [2024-11-07 01:45:57,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984860098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:57,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:57,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:57,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140036275] [2024-11-07 01:45:57,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:57,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:57,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:57,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:57,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:57,320 INFO L87 Difference]: Start difference. First operand 28695 states and 43892 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:02,439 INFO L93 Difference]: Finished difference Result 92507 states and 146588 transitions. [2024-11-07 01:46:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:46:02,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 102 [2024-11-07 01:46:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:02,741 INFO L225 Difference]: With dead ends: 92507 [2024-11-07 01:46:02,742 INFO L226 Difference]: Without dead ends: 68157 [2024-11-07 01:46:02,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:46:02,821 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1059 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 1864 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:02,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 1710 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1864 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:46:02,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68157 states. [2024-11-07 01:46:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68157 to 52825. [2024-11-07 01:46:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52825 states, 46954 states have (on average 1.499850917919666) internal successors, (70424), 47277 states have internal predecessors, (70424), 3559 states have call successors, (3559), 1933 states have call predecessors, (3559), 2310 states have return successors, (10575), 3876 states have call predecessors, (10575), 3556 states have call successors, (10575) [2024-11-07 01:46:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52825 states to 52825 states and 84558 transitions. [2024-11-07 01:46:07,456 INFO L78 Accepts]: Start accepts. Automaton has 52825 states and 84558 transitions. Word has length 102 [2024-11-07 01:46:07,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:07,456 INFO L471 AbstractCegarLoop]: Abstraction has 52825 states and 84558 transitions. [2024-11-07 01:46:07,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 52825 states and 84558 transitions. [2024-11-07 01:46:07,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 01:46:07,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:07,486 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] [2024-11-07 01:46:07,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 01:46:07,486 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:07,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:07,487 INFO L85 PathProgramCache]: Analyzing trace with hash 438808464, now seen corresponding path program 1 times [2024-11-07 01:46:07,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:07,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381749550] [2024-11-07 01:46:07,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:07,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:07,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:07,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:46:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:07,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:46:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:07,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:46:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:07,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:46:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:07,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:07,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381749550] [2024-11-07 01:46:07,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381749550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:07,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:07,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:07,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626835225] [2024-11-07 01:46:07,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:07,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:07,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:07,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:07,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:07,607 INFO L87 Difference]: Start difference. First operand 52825 states and 84558 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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)