./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.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_1.cil-2+token_ring.02.cil-1.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', 'c388302d41c726edd49d8ab9cbc4112c9573480c6a1055a6e43438be9deac626'] 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_1.cil-2+token_ring.02.cil-1.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 c388302d41c726edd49d8ab9cbc4112c9573480c6a1055a6e43438be9deac626 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:42:07,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:42:07,593 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:42:07,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:42:07,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:42:07,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:42:07,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:42:07,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:42:07,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:42:07,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:42:07,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:42:07,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:42:07,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:42:07,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:42:07,637 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:42:07,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:42:07,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:42:07,637 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:42:07,638 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:42:07,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:42:07,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:42:07,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:42:07,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:42:07,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:42:07,638 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:42:07,639 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:42:07,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:42:07,639 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:42:07,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:42:07,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:42:07,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:42:07,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:42:07,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:42:07,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:42:07,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:42:07,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:42:07,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:42:07,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:42:07,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:42:07,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:42:07,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:42:07,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:42:07,642 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 -> c388302d41c726edd49d8ab9cbc4112c9573480c6a1055a6e43438be9deac626 [2024-11-07 01:42:07,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:42:07,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:42:07,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:42:07,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:42:07,924 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:42:07,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2024-11-07 01:42:09,219 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:42:09,443 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:42:09,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2024-11-07 01:42:09,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a66be58af/a06c364b7cc24f6b9863e1939061729a/FLAGf8c9a964c [2024-11-07 01:42:09,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a66be58af/a06c364b7cc24f6b9863e1939061729a [2024-11-07 01:42:09,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:42:09,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:42:09,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:42:09,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:42:09,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:42:09,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:42:09" (1/1) ... [2024-11-07 01:42:09,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7168c4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:09, skipping insertion in model container [2024-11-07 01:42:09,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:42:09" (1/1) ... [2024-11-07 01:42:09,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:42:09,679 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_1.cil-2+token_ring.02.cil-1.c[913,926] [2024-11-07 01:42:09,736 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_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2024-11-07 01:42:09,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:42:09,800 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:42:09,809 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_1.cil-2+token_ring.02.cil-1.c[913,926] [2024-11-07 01:42:09,834 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_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2024-11-07 01:42:09,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:42:09,895 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:42:09,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:09 WrapperNode [2024-11-07 01:42:09,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:42:09,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:42:09,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:42:09,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:42:09,904 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:42:09" (1/1) ... [2024-11-07 01:42:09,913 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:42:09" (1/1) ... [2024-11-07 01:42:09,944 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 483 [2024-11-07 01:42:09,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:42:09,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:42:09,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:42:09,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:42:09,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:09" (1/1) ... [2024-11-07 01:42:09,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:09" (1/1) ... [2024-11-07 01:42:09,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:09" (1/1) ... [2024-11-07 01:42:09,976 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:42:09,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:09" (1/1) ... [2024-11-07 01:42:09,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:09" (1/1) ... [2024-11-07 01:42:09,983 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:09" (1/1) ... [2024-11-07 01:42:09,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:09" (1/1) ... [2024-11-07 01:42:09,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:09" (1/1) ... [2024-11-07 01:42:09,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:09" (1/1) ... [2024-11-07 01:42:09,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:42:09,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:42:09,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:42:09,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:42:10,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:09" (1/1) ... [2024-11-07 01:42:10,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:42:10,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:42:10,032 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:42:10,035 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:42:10,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:42:10,059 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:42:10,059 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:42:10,059 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-07 01:42:10,059 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-07 01:42:10,060 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:42:10,060 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:42:10,060 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:42:10,060 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:42:10,060 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:42:10,060 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:42:10,060 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:42:10,060 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:42:10,060 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:42:10,060 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:42:10,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:42:10,060 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:42:10,060 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:42:10,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:42:10,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:42:10,060 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:42:10,060 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:42:10,168 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:42:10,170 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:42:10,726 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-07 01:42:10,727 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:42:10,747 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:42:10,747 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-07 01:42:10,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:42:10 BoogieIcfgContainer [2024-11-07 01:42:10,747 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:42:10,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:42:10,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:42:10,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:42:10,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:42:09" (1/3) ... [2024-11-07 01:42:10,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e20ecf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:42:10, skipping insertion in model container [2024-11-07 01:42:10,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:09" (2/3) ... [2024-11-07 01:42:10,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e20ecf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:42:10, skipping insertion in model container [2024-11-07 01:42:10,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:42:10" (3/3) ... [2024-11-07 01:42:10,758 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2024-11-07 01:42:10,771 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:42:10,772 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:42:10,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:42:10,844 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;@6066ed23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:42:10,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:42:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 173 states have (on average 1.5549132947976878) internal successors, (269), 178 states have internal predecessors, (269), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 01:42:10,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 01:42:10,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:10,862 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] [2024-11-07 01:42:10,863 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:10,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:10,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1788777688, now seen corresponding path program 1 times [2024-11-07 01:42:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:10,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111875115] [2024-11-07 01:42:10,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:11,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:11,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 01:42:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:11,153 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:42:11,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:11,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111875115] [2024-11-07 01:42:11,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111875115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:11,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:11,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:42:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97544137] [2024-11-07 01:42:11,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:11,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:11,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:11,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:11,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:42:11,185 INFO L87 Difference]: Start difference. First operand has 207 states, 173 states have (on average 1.5549132947976878) internal successors, (269), 178 states have internal predecessors, (269), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:42:11,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:11,606 INFO L93 Difference]: Finished difference Result 469 states and 714 transitions. [2024-11-07 01:42:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:42:11,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-07 01:42:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:11,619 INFO L225 Difference]: With dead ends: 469 [2024-11-07 01:42:11,620 INFO L226 Difference]: Without dead ends: 267 [2024-11-07 01:42:11,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:42:11,626 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 346 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:11,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 460 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:42:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-07 01:42:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2024-11-07 01:42:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 222 states have (on average 1.4234234234234233) internal successors, (316), 226 states have internal predecessors, (316), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2024-11-07 01:42:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 372 transitions. [2024-11-07 01:42:11,684 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 372 transitions. Word has length 44 [2024-11-07 01:42:11,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:11,684 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 372 transitions. [2024-11-07 01:42:11,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:42:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 372 transitions. [2024-11-07 01:42:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-07 01:42:11,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:11,690 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] [2024-11-07 01:42:11,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:42:11,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:11,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:11,693 INFO L85 PathProgramCache]: Analyzing trace with hash -964636669, now seen corresponding path program 1 times [2024-11-07 01:42:11,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:11,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075833053] [2024-11-07 01:42:11,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:11,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:11,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:11,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 01:42:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:42:11,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:11,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075833053] [2024-11-07 01:42:11,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075833053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:11,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:11,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:42:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210505863] [2024-11-07 01:42:11,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:11,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:11,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:11,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:11,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:42:11,817 INFO L87 Difference]: Start difference. First operand 261 states and 372 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:42:12,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:12,144 INFO L93 Difference]: Finished difference Result 509 states and 712 transitions. [2024-11-07 01:42:12,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:42:12,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-07 01:42:12,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:12,148 INFO L225 Difference]: With dead ends: 509 [2024-11-07 01:42:12,148 INFO L226 Difference]: Without dead ends: 385 [2024-11-07 01:42:12,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:42:12,149 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 169 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:12,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 583 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:42:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-07 01:42:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 328. [2024-11-07 01:42:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 283 states have (on average 1.4134275618374559) internal successors, (400), 287 states have internal predecessors, (400), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (33), 27 states have call predecessors, (33), 27 states have call successors, (33) [2024-11-07 01:42:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 462 transitions. [2024-11-07 01:42:12,177 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 462 transitions. Word has length 45 [2024-11-07 01:42:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:12,177 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 462 transitions. [2024-11-07 01:42:12,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:42:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 462 transitions. [2024-11-07 01:42:12,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-07 01:42:12,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:12,179 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] [2024-11-07 01:42:12,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:42:12,179 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:12,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:12,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2045973166, now seen corresponding path program 1 times [2024-11-07 01:42:12,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:12,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189819362] [2024-11-07 01:42:12,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:12,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:12,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:12,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 01:42:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:12,265 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:42:12,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:12,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189819362] [2024-11-07 01:42:12,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189819362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:12,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:12,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:42:12,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89053014] [2024-11-07 01:42:12,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:12,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:12,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:12,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:12,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:42:12,267 INFO L87 Difference]: Start difference. First operand 328 states and 462 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:42:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:12,537 INFO L93 Difference]: Finished difference Result 736 states and 1021 transitions. [2024-11-07 01:42:12,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:42:12,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-07 01:42:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:12,543 INFO L225 Difference]: With dead ends: 736 [2024-11-07 01:42:12,544 INFO L226 Difference]: Without dead ends: 545 [2024-11-07 01:42:12,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:42:12,546 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 356 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:12,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 449 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:42:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-07 01:42:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 493. [2024-11-07 01:42:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 429 states have (on average 1.3752913752913754) internal successors, (590), 436 states have internal predecessors, (590), 40 states have call successors, (40), 21 states have call predecessors, (40), 22 states have return successors, (50), 36 states have call predecessors, (50), 38 states have call successors, (50) [2024-11-07 01:42:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 680 transitions. [2024-11-07 01:42:12,602 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 680 transitions. Word has length 45 [2024-11-07 01:42:12,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:12,602 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 680 transitions. [2024-11-07 01:42:12,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:42:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 680 transitions. [2024-11-07 01:42:12,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-07 01:42:12,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:12,610 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] [2024-11-07 01:42:12,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:42:12,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:12,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash -544385256, now seen corresponding path program 1 times [2024-11-07 01:42:12,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:12,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427037494] [2024-11-07 01:42:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:12,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:12,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:12,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:42:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:12,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 01:42:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:12,753 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:42:12,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:12,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427037494] [2024-11-07 01:42:12,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427037494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:12,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:12,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:42:12,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855246826] [2024-11-07 01:42:12,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:12,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:12,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:12,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:12,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:42:12,759 INFO L87 Difference]: Start difference. First operand 493 states and 680 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 01:42:13,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:13,069 INFO L93 Difference]: Finished difference Result 1077 states and 1465 transitions. [2024-11-07 01:42:13,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:42:13,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2024-11-07 01:42:13,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:13,077 INFO L225 Difference]: With dead ends: 1077 [2024-11-07 01:42:13,077 INFO L226 Difference]: Without dead ends: 721 [2024-11-07 01:42:13,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:42:13,081 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 153 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:13,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 636 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:42:13,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-07 01:42:13,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 683. [2024-11-07 01:42:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 595 states have (on average 1.3277310924369747) internal successors, (790), 604 states have internal predecessors, (790), 54 states have call successors, (54), 29 states have call predecessors, (54), 32 states have return successors, (74), 50 states have call predecessors, (74), 52 states have call successors, (74) [2024-11-07 01:42:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 918 transitions. [2024-11-07 01:42:13,168 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 918 transitions. Word has length 62 [2024-11-07 01:42:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:13,169 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 918 transitions. [2024-11-07 01:42:13,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 01:42:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 918 transitions. [2024-11-07 01:42:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 01:42:13,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:13,174 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] [2024-11-07 01:42:13,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:42:13,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:13,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:13,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1324290499, now seen corresponding path program 1 times [2024-11-07 01:42:13,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:13,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150389081] [2024-11-07 01:42:13,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:13,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:13,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:13,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:42:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:13,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:42:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-07 01:42:13,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:13,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150389081] [2024-11-07 01:42:13,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150389081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:13,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:13,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:42:13,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790984545] [2024-11-07 01:42:13,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:13,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:13,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:13,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:13,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:42:13,277 INFO L87 Difference]: Start difference. First operand 683 states and 918 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 01:42:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:13,543 INFO L93 Difference]: Finished difference Result 1336 states and 1771 transitions. [2024-11-07 01:42:13,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:42:13,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2024-11-07 01:42:13,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:13,553 INFO L225 Difference]: With dead ends: 1336 [2024-11-07 01:42:13,554 INFO L226 Difference]: Without dead ends: 882 [2024-11-07 01:42:13,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:42:13,556 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 343 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:13,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 448 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:42:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-11-07 01:42:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 827. [2024-11-07 01:42:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 723 states have (on average 1.301521438450899) internal successors, (941), 734 states have internal predecessors, (941), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (88), 58 states have call predecessors, (88), 60 states have call successors, (88) [2024-11-07 01:42:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1091 transitions. [2024-11-07 01:42:13,646 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1091 transitions. Word has length 67 [2024-11-07 01:42:13,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:13,646 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1091 transitions. [2024-11-07 01:42:13,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 01:42:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1091 transitions. [2024-11-07 01:42:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:13,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:13,649 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] [2024-11-07 01:42:13,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:42:13,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:13,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:13,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1855697567, now seen corresponding path program 1 times [2024-11-07 01:42:13,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:13,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508849243] [2024-11-07 01:42:13,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:13,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:13,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:13,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:13,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:13,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:13,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:13,842 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:42:13,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:13,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508849243] [2024-11-07 01:42:13,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508849243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:13,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:13,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:42:13,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989924797] [2024-11-07 01:42:13,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:13,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:42:13,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:13,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:42:13,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:42:13,844 INFO L87 Difference]: Start difference. First operand 827 states and 1091 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:14,670 INFO L93 Difference]: Finished difference Result 1129 states and 1544 transitions. [2024-11-07 01:42:14,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:42:14,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-07 01:42:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:14,688 INFO L225 Difference]: With dead ends: 1129 [2024-11-07 01:42:14,689 INFO L226 Difference]: Without dead ends: 1009 [2024-11-07 01:42:14,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:42:14,692 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 561 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:14,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 667 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:42:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-11-07 01:42:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 946. [2024-11-07 01:42:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 824 states have (on average 1.3228155339805825) internal successors, (1090), 836 states have internal predecessors, (1090), 73 states have call successors, (73), 41 states have call predecessors, (73), 47 states have return successors, (102), 69 states have call predecessors, (102), 71 states have call successors, (102) [2024-11-07 01:42:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1265 transitions. [2024-11-07 01:42:14,771 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1265 transitions. Word has length 68 [2024-11-07 01:42:14,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:14,771 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1265 transitions. [2024-11-07 01:42:14,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1265 transitions. [2024-11-07 01:42:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:14,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:14,774 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] [2024-11-07 01:42:14,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:42:14,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:14,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash -911935709, now seen corresponding path program 1 times [2024-11-07 01:42:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:14,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544192906] [2024-11-07 01:42:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:14,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:14,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:14,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:14,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:14,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:14,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:42:14,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:14,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544192906] [2024-11-07 01:42:14,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544192906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:14,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:14,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:14,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762986671] [2024-11-07 01:42:14,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:14,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:14,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:14,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:14,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:14,943 INFO L87 Difference]: Start difference. First operand 946 states and 1265 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:16,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:16,010 INFO L93 Difference]: Finished difference Result 1398 states and 1934 transitions. [2024-11-07 01:42:16,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:42:16,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-07 01:42:16,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:16,016 INFO L225 Difference]: With dead ends: 1398 [2024-11-07 01:42:16,017 INFO L226 Difference]: Without dead ends: 1159 [2024-11-07 01:42:16,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:42:16,018 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 564 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:16,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 1096 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:42:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-07 01:42:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1058. [2024-11-07 01:42:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 918 states have (on average 1.3344226579520697) internal successors, (1225), 931 states have internal predecessors, (1225), 84 states have call successors, (84), 47 states have call predecessors, (84), 54 states have return successors, (115), 81 states have call predecessors, (115), 82 states have call successors, (115) [2024-11-07 01:42:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1424 transitions. [2024-11-07 01:42:16,100 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1424 transitions. Word has length 68 [2024-11-07 01:42:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:16,100 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1424 transitions. [2024-11-07 01:42:16,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1424 transitions. [2024-11-07 01:42:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:16,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:16,103 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] [2024-11-07 01:42:16,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:42:16,103 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:16,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:16,105 INFO L85 PathProgramCache]: Analyzing trace with hash -35916703, now seen corresponding path program 1 times [2024-11-07 01:42:16,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:16,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742809415] [2024-11-07 01:42:16,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:16,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:16,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:16,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:16,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:16,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:16,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:16,240 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:42:16,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:16,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742809415] [2024-11-07 01:42:16,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742809415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:16,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:16,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:16,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518132962] [2024-11-07 01:42:16,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:16,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:16,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:16,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:16,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:16,243 INFO L87 Difference]: Start difference. First operand 1058 states and 1424 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:17,427 INFO L93 Difference]: Finished difference Result 1866 states and 2613 transitions. [2024-11-07 01:42:17,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:42:17,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-07 01:42:17,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:17,435 INFO L225 Difference]: With dead ends: 1866 [2024-11-07 01:42:17,435 INFO L226 Difference]: Without dead ends: 1515 [2024-11-07 01:42:17,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:42:17,437 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 581 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:17,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1084 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:42:17,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-07 01:42:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1280. [2024-11-07 01:42:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1106 states have (on average 1.3544303797468353) internal successors, (1498), 1121 states have internal predecessors, (1498), 104 states have call successors, (104), 59 states have call predecessors, (104), 68 states have return successors, (143), 103 states have call predecessors, (143), 102 states have call successors, (143) [2024-11-07 01:42:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1745 transitions. [2024-11-07 01:42:17,521 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1745 transitions. Word has length 68 [2024-11-07 01:42:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:17,521 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1745 transitions. [2024-11-07 01:42:17,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1745 transitions. [2024-11-07 01:42:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:17,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:17,525 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] [2024-11-07 01:42:17,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:42:17,525 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:17,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:17,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1502423327, now seen corresponding path program 1 times [2024-11-07 01:42:17,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694500276] [2024-11-07 01:42:17,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:17,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:17,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:17,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:17,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:17,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:17,676 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:42:17,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:17,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694500276] [2024-11-07 01:42:17,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694500276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:17,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:17,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:17,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014361269] [2024-11-07 01:42:17,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:17,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:17,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:17,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:17,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:17,678 INFO L87 Difference]: Start difference. First operand 1280 states and 1745 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:18,727 INFO L93 Difference]: Finished difference Result 2644 states and 3738 transitions. [2024-11-07 01:42:18,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:42:18,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-07 01:42:18,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:18,739 INFO L225 Difference]: With dead ends: 2644 [2024-11-07 01:42:18,739 INFO L226 Difference]: Without dead ends: 2071 [2024-11-07 01:42:18,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:42:18,742 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 613 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:18,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 1080 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:42:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2024-11-07 01:42:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1699. [2024-11-07 01:42:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1459 states have (on average 1.3762851267991776) internal successors, (2008), 1478 states have internal predecessors, (2008), 142 states have call successors, (142), 83 states have call predecessors, (142), 96 states have return successors, (203), 145 states have call predecessors, (203), 140 states have call successors, (203) [2024-11-07 01:42:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2353 transitions. [2024-11-07 01:42:18,887 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2353 transitions. Word has length 68 [2024-11-07 01:42:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:18,888 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2353 transitions. [2024-11-07 01:42:18,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2353 transitions. [2024-11-07 01:42:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:18,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:18,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:18,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:42:18,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:18,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:18,894 INFO L85 PathProgramCache]: Analyzing trace with hash -526162783, now seen corresponding path program 1 times [2024-11-07 01:42:18,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:18,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342579086] [2024-11-07 01:42:18,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:18,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:18,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:18,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:19,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:19,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:19,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:42:19,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:19,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342579086] [2024-11-07 01:42:19,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342579086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:19,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:19,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:19,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614823661] [2024-11-07 01:42:19,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:19,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:19,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:19,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:19,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:19,039 INFO L87 Difference]: Start difference. First operand 1699 states and 2353 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:20,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:20,061 INFO L93 Difference]: Finished difference Result 4047 states and 5774 transitions. [2024-11-07 01:42:20,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:42:20,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-07 01:42:20,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:20,076 INFO L225 Difference]: With dead ends: 4047 [2024-11-07 01:42:20,076 INFO L226 Difference]: Without dead ends: 3055 [2024-11-07 01:42:20,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:42:20,083 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 571 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:20,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1058 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:42:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2024-11-07 01:42:20,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 2546. [2024-11-07 01:42:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2182 states have (on average 1.4023831347387719) internal successors, (3060), 2209 states have internal predecessors, (3060), 212 states have call successors, (212), 129 states have call predecessors, (212), 150 states have return successors, (335), 223 states have call predecessors, (335), 210 states have call successors, (335) [2024-11-07 01:42:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3607 transitions. [2024-11-07 01:42:20,327 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3607 transitions. Word has length 68 [2024-11-07 01:42:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:20,327 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 3607 transitions. [2024-11-07 01:42:20,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:20,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3607 transitions. [2024-11-07 01:42:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:20,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:20,334 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] [2024-11-07 01:42:20,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:42:20,334 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:20,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:20,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1007243041, now seen corresponding path program 1 times [2024-11-07 01:42:20,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:20,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725432832] [2024-11-07 01:42:20,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:20,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:20,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:20,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:20,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:20,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:20,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:20,482 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:42:20,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:20,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725432832] [2024-11-07 01:42:20,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725432832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:20,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:20,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:20,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622232083] [2024-11-07 01:42:20,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:20,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:20,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:20,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:20,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:20,484 INFO L87 Difference]: Start difference. First operand 2546 states and 3607 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:21,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:21,181 INFO L93 Difference]: Finished difference Result 4802 states and 6950 transitions. [2024-11-07 01:42:21,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 01:42:21,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-07 01:42:21,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:21,196 INFO L225 Difference]: With dead ends: 4802 [2024-11-07 01:42:21,196 INFO L226 Difference]: Without dead ends: 2964 [2024-11-07 01:42:21,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:42:21,203 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 205 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:21,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 924 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:42:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2024-11-07 01:42:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2597. [2024-11-07 01:42:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2233 states have (on average 1.3931930138826691) internal successors, (3111), 2260 states have internal predecessors, (3111), 212 states have call successors, (212), 129 states have call predecessors, (212), 150 states have return successors, (335), 223 states have call predecessors, (335), 210 states have call successors, (335) [2024-11-07 01:42:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 3658 transitions. [2024-11-07 01:42:21,399 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 3658 transitions. Word has length 68 [2024-11-07 01:42:21,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:21,399 INFO L471 AbstractCegarLoop]: Abstraction has 2597 states and 3658 transitions. [2024-11-07 01:42:21,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 3658 transitions. [2024-11-07 01:42:21,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:21,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:21,403 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] [2024-11-07 01:42:21,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:42:21,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:21,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:21,403 INFO L85 PathProgramCache]: Analyzing trace with hash -583596319, now seen corresponding path program 1 times [2024-11-07 01:42:21,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:21,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967119724] [2024-11-07 01:42:21,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:21,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:21,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:21,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:21,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:21,499 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:42:21,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:21,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967119724] [2024-11-07 01:42:21,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967119724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:21,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:21,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:42:21,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658563245] [2024-11-07 01:42:21,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:21,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:42:21,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:21,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:42:21,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:42:21,501 INFO L87 Difference]: Start difference. First operand 2597 states and 3658 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:22,526 INFO L93 Difference]: Finished difference Result 7003 states and 10044 transitions. [2024-11-07 01:42:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:42:22,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-07 01:42:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:22,553 INFO L225 Difference]: With dead ends: 7003 [2024-11-07 01:42:22,553 INFO L226 Difference]: Without dead ends: 5114 [2024-11-07 01:42:22,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:42:22,561 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 733 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:22,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 835 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:42:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5114 states. [2024-11-07 01:42:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5114 to 4365. [2024-11-07 01:42:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4365 states, 3736 states have (on average 1.4012312633832977) internal successors, (5235), 3779 states have internal predecessors, (5235), 363 states have call successors, (363), 227 states have call predecessors, (363), 264 states have return successors, (568), 374 states have call predecessors, (568), 361 states have call successors, (568) [2024-11-07 01:42:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 6166 transitions. [2024-11-07 01:42:22,909 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 6166 transitions. Word has length 68 [2024-11-07 01:42:22,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:22,909 INFO L471 AbstractCegarLoop]: Abstraction has 4365 states and 6166 transitions. [2024-11-07 01:42:22,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 6166 transitions. [2024-11-07 01:42:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:22,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:22,913 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] [2024-11-07 01:42:22,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:42:22,914 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:22,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1540524702, now seen corresponding path program 1 times [2024-11-07 01:42:22,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:22,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548552940] [2024-11-07 01:42:22,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:22,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:22,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:22,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:22,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:23,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:23,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:23,025 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:42:23,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:23,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548552940] [2024-11-07 01:42:23,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548552940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:23,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:23,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:23,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197739625] [2024-11-07 01:42:23,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:23,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:23,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:23,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:23,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:23,029 INFO L87 Difference]: Start difference. First operand 4365 states and 6166 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:23,834 INFO L93 Difference]: Finished difference Result 8837 states and 12645 transitions. [2024-11-07 01:42:23,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:42:23,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-07 01:42:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:23,862 INFO L225 Difference]: With dead ends: 8837 [2024-11-07 01:42:23,863 INFO L226 Difference]: Without dead ends: 5180 [2024-11-07 01:42:23,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 01:42:23,877 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 218 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:23,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 924 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:42:23,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5180 states. [2024-11-07 01:42:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5180 to 4416. [2024-11-07 01:42:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4416 states, 3787 states have (on average 1.391338790599419) internal successors, (5269), 3830 states have internal predecessors, (5269), 363 states have call successors, (363), 227 states have call predecessors, (363), 264 states have return successors, (568), 374 states have call predecessors, (568), 361 states have call successors, (568) [2024-11-07 01:42:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 4416 states and 6200 transitions. [2024-11-07 01:42:24,291 INFO L78 Accepts]: Start accepts. Automaton has 4416 states and 6200 transitions. Word has length 68 [2024-11-07 01:42:24,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:24,292 INFO L471 AbstractCegarLoop]: Abstraction has 4416 states and 6200 transitions. [2024-11-07 01:42:24,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4416 states and 6200 transitions. [2024-11-07 01:42:24,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:24,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:24,297 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] [2024-11-07 01:42:24,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:42:24,297 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:24,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:24,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1910437092, now seen corresponding path program 1 times [2024-11-07 01:42:24,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:24,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53106505] [2024-11-07 01:42:24,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:24,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:24,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:24,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:24,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:24,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:24,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:24,380 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:42:24,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:24,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53106505] [2024-11-07 01:42:24,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53106505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:24,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:24,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:42:24,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364338036] [2024-11-07 01:42:24,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:24,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:42:24,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:24,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:42:24,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:42:24,381 INFO L87 Difference]: Start difference. First operand 4416 states and 6200 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:25,404 INFO L93 Difference]: Finished difference Result 13173 states and 18578 transitions. [2024-11-07 01:42:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:42:25,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-07 01:42:25,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:25,435 INFO L225 Difference]: With dead ends: 13173 [2024-11-07 01:42:25,436 INFO L226 Difference]: Without dead ends: 9465 [2024-11-07 01:42:25,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:42:25,446 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 781 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:25,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 835 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:42:25,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9465 states. [2024-11-07 01:42:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9465 to 7913. [2024-11-07 01:42:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7913 states, 6771 states have (on average 1.392261113572589) internal successors, (9427), 6846 states have internal predecessors, (9427), 652 states have call successors, (652), 419 states have call predecessors, (652), 488 states have return successors, (1021), 663 states have call predecessors, (1021), 650 states have call successors, (1021) [2024-11-07 01:42:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7913 states to 7913 states and 11100 transitions. [2024-11-07 01:42:26,053 INFO L78 Accepts]: Start accepts. Automaton has 7913 states and 11100 transitions. Word has length 68 [2024-11-07 01:42:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:26,054 INFO L471 AbstractCegarLoop]: Abstraction has 7913 states and 11100 transitions. [2024-11-07 01:42:26,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:26,054 INFO L276 IsEmpty]: Start isEmpty. Operand 7913 states and 11100 transitions. [2024-11-07 01:42:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:26,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:26,058 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] [2024-11-07 01:42:26,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:42:26,058 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:26,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:26,059 INFO L85 PathProgramCache]: Analyzing trace with hash 333879333, now seen corresponding path program 1 times [2024-11-07 01:42:26,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:26,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616251562] [2024-11-07 01:42:26,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:26,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:26,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:26,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:26,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:26,176 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:42:26,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:26,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616251562] [2024-11-07 01:42:26,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616251562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:26,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:26,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:26,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701696319] [2024-11-07 01:42:26,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:26,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:26,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:26,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:26,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:26,177 INFO L87 Difference]: Start difference. First operand 7913 states and 11100 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:27,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:27,406 INFO L93 Difference]: Finished difference Result 16804 states and 23654 transitions. [2024-11-07 01:42:27,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:42:27,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-07 01:42:27,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:27,451 INFO L225 Difference]: With dead ends: 16804 [2024-11-07 01:42:27,451 INFO L226 Difference]: Without dead ends: 9599 [2024-11-07 01:42:27,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 01:42:27,555 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 220 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:27,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 920 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:42:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9599 states. [2024-11-07 01:42:27,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9599 to 8015. [2024-11-07 01:42:27,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8015 states, 6873 states have (on average 1.381492797904845) internal successors, (9495), 6948 states have internal predecessors, (9495), 652 states have call successors, (652), 419 states have call predecessors, (652), 488 states have return successors, (1021), 663 states have call predecessors, (1021), 650 states have call successors, (1021) [2024-11-07 01:42:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8015 states to 8015 states and 11168 transitions. [2024-11-07 01:42:28,014 INFO L78 Accepts]: Start accepts. Automaton has 8015 states and 11168 transitions. Word has length 68 [2024-11-07 01:42:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:28,015 INFO L471 AbstractCegarLoop]: Abstraction has 8015 states and 11168 transitions. [2024-11-07 01:42:28,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:28,015 INFO L276 IsEmpty]: Start isEmpty. Operand 8015 states and 11168 transitions. [2024-11-07 01:42:28,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:28,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:28,019 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] [2024-11-07 01:42:28,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:42:28,019 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:28,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:28,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1720082727, now seen corresponding path program 1 times [2024-11-07 01:42:28,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:28,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737922738] [2024-11-07 01:42:28,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:28,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:28,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:28,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:28,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:28,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:28,172 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:42:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:28,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737922738] [2024-11-07 01:42:28,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737922738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:28,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:28,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:42:28,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894096219] [2024-11-07 01:42:28,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:28,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:42:28,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:28,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:42:28,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:42:28,176 INFO L87 Difference]: Start difference. First operand 8015 states and 11168 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:29,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:29,088 INFO L93 Difference]: Finished difference Result 10069 states and 13951 transitions. [2024-11-07 01:42:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:42:29,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-07 01:42:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:29,119 INFO L225 Difference]: With dead ends: 10069 [2024-11-07 01:42:29,120 INFO L226 Difference]: Without dead ends: 6112 [2024-11-07 01:42:29,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:42:29,134 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 844 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:29,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 820 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:42:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6112 states. [2024-11-07 01:42:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6112 to 4988. [2024-11-07 01:42:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4276 states have (on average 1.3592142188961647) internal successors, (5812), 4319 states have internal predecessors, (5812), 413 states have call successors, (413), 260 states have call predecessors, (413), 297 states have return successors, (554), 416 states have call predecessors, (554), 411 states have call successors, (554) [2024-11-07 01:42:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 6779 transitions. [2024-11-07 01:42:29,409 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 6779 transitions. Word has length 68 [2024-11-07 01:42:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:29,409 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 6779 transitions. [2024-11-07 01:42:29,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 6779 transitions. [2024-11-07 01:42:29,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:29,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:29,412 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] [2024-11-07 01:42:29,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:42:29,412 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:29,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:29,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1586069221, now seen corresponding path program 1 times [2024-11-07 01:42:29,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:29,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866476772] [2024-11-07 01:42:29,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:29,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:29,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:29,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:29,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:29,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:29,554 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:42:29,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:29,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866476772] [2024-11-07 01:42:29,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866476772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:29,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:29,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:42:29,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337003515] [2024-11-07 01:42:29,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:29,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:42:29,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:29,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:42:29,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:42:29,555 INFO L87 Difference]: Start difference. First operand 4988 states and 6779 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:30,800 INFO L93 Difference]: Finished difference Result 14516 states and 19805 transitions. [2024-11-07 01:42:30,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:42:30,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-07 01:42:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:30,842 INFO L225 Difference]: With dead ends: 14516 [2024-11-07 01:42:30,842 INFO L226 Difference]: Without dead ends: 10237 [2024-11-07 01:42:30,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:42:30,858 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 839 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:30,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 823 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:42:30,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10237 states. [2024-11-07 01:42:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10237 to 8367. [2024-11-07 01:42:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8367 states, 7131 states have (on average 1.3505819660636658) internal successors, (9631), 7234 states have internal predecessors, (9631), 694 states have call successors, (694), 443 states have call predecessors, (694), 540 states have return successors, (1011), 705 states have call predecessors, (1011), 692 states have call successors, (1011) [2024-11-07 01:42:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8367 states to 8367 states and 11336 transitions. [2024-11-07 01:42:31,557 INFO L78 Accepts]: Start accepts. Automaton has 8367 states and 11336 transitions. Word has length 68 [2024-11-07 01:42:31,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:31,558 INFO L471 AbstractCegarLoop]: Abstraction has 8367 states and 11336 transitions. [2024-11-07 01:42:31,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:31,558 INFO L276 IsEmpty]: Start isEmpty. Operand 8367 states and 11336 transitions. [2024-11-07 01:42:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:31,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:31,561 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] [2024-11-07 01:42:31,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:42:31,562 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:31,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:31,562 INFO L85 PathProgramCache]: Analyzing trace with hash -219369113, now seen corresponding path program 1 times [2024-11-07 01:42:31,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:31,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961681940] [2024-11-07 01:42:31,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:31,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:31,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:31,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:31,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:31,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:31,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:42:31,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:31,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961681940] [2024-11-07 01:42:31,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961681940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:31,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:31,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:42:31,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360407999] [2024-11-07 01:42:31,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:31,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:42:31,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:31,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:42:31,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:42:31,703 INFO L87 Difference]: Start difference. First operand 8367 states and 11336 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:33,079 INFO L93 Difference]: Finished difference Result 13655 states and 18287 transitions. [2024-11-07 01:42:33,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:42:33,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-07 01:42:33,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:33,118 INFO L225 Difference]: With dead ends: 13655 [2024-11-07 01:42:33,118 INFO L226 Difference]: Without dead ends: 9255 [2024-11-07 01:42:33,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-07 01:42:33,133 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 725 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:33,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 944 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:42:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9255 states. [2024-11-07 01:42:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9255 to 6719. [2024-11-07 01:42:33,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6719 states, 5735 states have (on average 1.3379250217959895) internal successors, (7673), 5810 states have internal predecessors, (7673), 560 states have call successors, (560), 353 states have call predecessors, (560), 422 states have return successors, (741), 563 states have call predecessors, (741), 558 states have call successors, (741) [2024-11-07 01:42:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6719 states to 6719 states and 8974 transitions. [2024-11-07 01:42:33,644 INFO L78 Accepts]: Start accepts. Automaton has 6719 states and 8974 transitions. Word has length 68 [2024-11-07 01:42:33,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:33,644 INFO L471 AbstractCegarLoop]: Abstraction has 6719 states and 8974 transitions. [2024-11-07 01:42:33,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:33,644 INFO L276 IsEmpty]: Start isEmpty. Operand 6719 states and 8974 transitions. [2024-11-07 01:42:33,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:33,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:33,647 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] [2024-11-07 01:42:33,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:42:33,647 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:33,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash -514395, now seen corresponding path program 1 times [2024-11-07 01:42:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:33,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340621495] [2024-11-07 01:42:33,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:33,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:33,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:33,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:33,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:33,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:33,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:33,783 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:42:33,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:33,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340621495] [2024-11-07 01:42:33,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340621495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:33,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:33,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:42:33,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350312064] [2024-11-07 01:42:33,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:33,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:42:33,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:33,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:42:33,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:42:33,786 INFO L87 Difference]: Start difference. First operand 6719 states and 8974 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:34,896 INFO L93 Difference]: Finished difference Result 12407 states and 16523 transitions. [2024-11-07 01:42:34,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:42:34,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-07 01:42:34,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:34,930 INFO L225 Difference]: With dead ends: 12407 [2024-11-07 01:42:34,930 INFO L226 Difference]: Without dead ends: 8795 [2024-11-07 01:42:34,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-07 01:42:34,946 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 855 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:34,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 815 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:42:34,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8795 states. [2024-11-07 01:42:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8795 to 6669. [2024-11-07 01:42:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6669 states, 5697 states have (on average 1.3307003686150605) internal successors, (7581), 5760 states have internal predecessors, (7581), 560 states have call successors, (560), 353 states have call predecessors, (560), 410 states have return successors, (689), 559 states have call predecessors, (689), 558 states have call successors, (689) [2024-11-07 01:42:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6669 states to 6669 states and 8830 transitions. [2024-11-07 01:42:35,478 INFO L78 Accepts]: Start accepts. Automaton has 6669 states and 8830 transitions. Word has length 68 [2024-11-07 01:42:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:35,479 INFO L471 AbstractCegarLoop]: Abstraction has 6669 states and 8830 transitions. [2024-11-07 01:42:35,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:35,480 INFO L276 IsEmpty]: Start isEmpty. Operand 6669 states and 8830 transitions. [2024-11-07 01:42:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:35,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:35,482 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] [2024-11-07 01:42:35,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:42:35,483 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:35,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:35,483 INFO L85 PathProgramCache]: Analyzing trace with hash 422187431, now seen corresponding path program 1 times [2024-11-07 01:42:35,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:35,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904857452] [2024-11-07 01:42:35,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:35,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:35,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:35,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:35,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:35,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:35,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:35,613 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:42:35,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:35,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904857452] [2024-11-07 01:42:35,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904857452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:35,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:35,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:42:35,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443870460] [2024-11-07 01:42:35,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:35,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:42:35,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:35,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:42:35,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:42:35,615 INFO L87 Difference]: Start difference. First operand 6669 states and 8830 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:36,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:36,808 INFO L93 Difference]: Finished difference Result 10511 states and 13851 transitions. [2024-11-07 01:42:36,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:42:36,809 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-07 01:42:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:36,839 INFO L225 Difference]: With dead ends: 10511 [2024-11-07 01:42:36,839 INFO L226 Difference]: Without dead ends: 6977 [2024-11-07 01:42:36,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-07 01:42:36,850 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 701 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:36,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 945 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:42:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6977 states. [2024-11-07 01:42:37,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6977 to 5395. [2024-11-07 01:42:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5395 states, 4623 states have (on average 1.3240320138438244) internal successors, (6121), 4656 states have internal predecessors, (6121), 458 states have call successors, (458), 285 states have call predecessors, (458), 312 states have return successors, (525), 455 states have call predecessors, (525), 456 states have call successors, (525) [2024-11-07 01:42:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5395 states to 5395 states and 7104 transitions. [2024-11-07 01:42:37,382 INFO L78 Accepts]: Start accepts. Automaton has 5395 states and 7104 transitions. Word has length 68 [2024-11-07 01:42:37,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:37,382 INFO L471 AbstractCegarLoop]: Abstraction has 5395 states and 7104 transitions. [2024-11-07 01:42:37,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 5395 states and 7104 transitions. [2024-11-07 01:42:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:37,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:37,384 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] [2024-11-07 01:42:37,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:42:37,384 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:37,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:37,385 INFO L85 PathProgramCache]: Analyzing trace with hash -395461019, now seen corresponding path program 1 times [2024-11-07 01:42:37,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:37,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802436974] [2024-11-07 01:42:37,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:37,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,461 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:42:37,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:37,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802436974] [2024-11-07 01:42:37,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802436974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:37,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:37,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:42:37,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839007379] [2024-11-07 01:42:37,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:37,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:42:37,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:37,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:42:37,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:42:37,463 INFO L87 Difference]: Start difference. First operand 5395 states and 7104 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 01:42:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:38,478 INFO L93 Difference]: Finished difference Result 12862 states and 16989 transitions. [2024-11-07 01:42:38,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:42:38,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2024-11-07 01:42:38,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:38,521 INFO L225 Difference]: With dead ends: 12862 [2024-11-07 01:42:38,521 INFO L226 Difference]: Without dead ends: 8131 [2024-11-07 01:42:38,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:42:38,536 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 621 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:38,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 511 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:42:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8131 states. [2024-11-07 01:42:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8131 to 6765. [2024-11-07 01:42:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6765 states, 5785 states have (on average 1.3085566119273984) internal successors, (7570), 5848 states have internal predecessors, (7570), 578 states have call successors, (578), 369 states have call predecessors, (578), 400 states have return successors, (649), 549 states have call predecessors, (649), 576 states have call successors, (649) [2024-11-07 01:42:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6765 states to 6765 states and 8797 transitions. [2024-11-07 01:42:39,066 INFO L78 Accepts]: Start accepts. Automaton has 6765 states and 8797 transitions. Word has length 68 [2024-11-07 01:42:39,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:39,066 INFO L471 AbstractCegarLoop]: Abstraction has 6765 states and 8797 transitions. [2024-11-07 01:42:39,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 01:42:39,066 INFO L276 IsEmpty]: Start isEmpty. Operand 6765 states and 8797 transitions. [2024-11-07 01:42:39,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:39,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:39,068 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:42:39,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 01:42:39,068 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:39,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:39,068 INFO L85 PathProgramCache]: Analyzing trace with hash 491350726, now seen corresponding path program 1 times [2024-11-07 01:42:39,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:39,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309022927] [2024-11-07 01:42:39,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:39,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:39,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:39,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:42:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:39,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:42:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:42:39,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:39,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309022927] [2024-11-07 01:42:39,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309022927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:42:39,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875042109] [2024-11-07 01:42:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:39,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:39,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:42:39,140 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:42:39,141 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:42:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:39,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 01:42:39,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:42:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:42:39,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:42:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 01:42:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875042109] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 01:42:39,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 01:42:39,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-07 01:42:39,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149972280] [2024-11-07 01:42:39,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:39,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:39,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:39,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:42:39,351 INFO L87 Difference]: Start difference. First operand 6765 states and 8797 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 01:42:39,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:39,888 INFO L93 Difference]: Finished difference Result 6821 states and 8865 transitions. [2024-11-07 01:42:39,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:42:39,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2024-11-07 01:42:39,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:39,931 INFO L225 Difference]: With dead ends: 6821 [2024-11-07 01:42:39,931 INFO L226 Difference]: Without dead ends: 6818 [2024-11-07 01:42:39,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:42:39,939 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 485 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:39,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 372 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:42:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6818 states. [2024-11-07 01:42:40,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6818 to 6764. [2024-11-07 01:42:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6764 states, 5785 states have (on average 1.3082108902333622) internal successors, (7568), 5847 states have internal predecessors, (7568), 577 states have call successors, (577), 369 states have call predecessors, (577), 400 states have return successors, (649), 549 states have call predecessors, (649), 576 states have call successors, (649) [2024-11-07 01:42:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6764 states to 6764 states and 8794 transitions. [2024-11-07 01:42:40,491 INFO L78 Accepts]: Start accepts. Automaton has 6764 states and 8794 transitions. Word has length 68 [2024-11-07 01:42:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:40,492 INFO L471 AbstractCegarLoop]: Abstraction has 6764 states and 8794 transitions. [2024-11-07 01:42:40,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 01:42:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 6764 states and 8794 transitions. [2024-11-07 01:42:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:42:40,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:40,494 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:42:40,512 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:42:40,694 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,SelfDestructingSolverStorable21 [2024-11-07 01:42:40,695 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:40,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:40,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1948658970, now seen corresponding path program 1 times [2024-11-07 01:42:40,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:40,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053067852] [2024-11-07 01:42:40,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:40,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:40,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:42:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:40,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:42:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:42:40,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:40,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053067852] [2024-11-07 01:42:40,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053067852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:42:40,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466109942] [2024-11-07 01:42:40,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:40,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:40,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:42:40,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:42:40,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 01:42:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:40,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 01:42:40,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:42:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:42:41,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:42:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 01:42:41,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466109942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:42:41,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:42:41,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-07 01:42:41,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128617461] [2024-11-07 01:42:41,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:42:41,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 01:42:41,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:41,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 01:42:41,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:42:41,104 INFO L87 Difference]: Start difference. First operand 6764 states and 8794 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-07 01:42:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:42,311 INFO L93 Difference]: Finished difference Result 8271 states and 10782 transitions. [2024-11-07 01:42:42,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 01:42:42,311 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2024-11-07 01:42:42,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:42,345 INFO L225 Difference]: With dead ends: 8271 [2024-11-07 01:42:42,345 INFO L226 Difference]: Without dead ends: 7727 [2024-11-07 01:42:42,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-07 01:42:42,353 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 525 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:42,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 2208 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:42:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7727 states. [2024-11-07 01:42:42,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7727 to 7127. [2024-11-07 01:42:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7127 states, 6109 states have (on average 1.3043051235881487) internal successors, (7968), 6179 states have internal predecessors, (7968), 597 states have call successors, (597), 383 states have call predecessors, (597), 419 states have return successors, (683), 566 states have call predecessors, (683), 596 states have call successors, (683) [2024-11-07 01:42:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7127 states to 7127 states and 9248 transitions. [2024-11-07 01:42:42,958 INFO L78 Accepts]: Start accepts. Automaton has 7127 states and 9248 transitions. Word has length 69 [2024-11-07 01:42:42,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:42,959 INFO L471 AbstractCegarLoop]: Abstraction has 7127 states and 9248 transitions. [2024-11-07 01:42:42,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-07 01:42:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 7127 states and 9248 transitions. [2024-11-07 01:42:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 01:42:42,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:42,963 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 01:42:42,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 01:42:43,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:43,163 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:43,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:43,164 INFO L85 PathProgramCache]: Analyzing trace with hash -104048128, now seen corresponding path program 1 times [2024-11-07 01:42:43,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:43,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256828083] [2024-11-07 01:42:43,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:43,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:43,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:43,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:42:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:43,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 01:42:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:43,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 01:42:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-07 01:42:43,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:43,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256828083] [2024-11-07 01:42:43,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256828083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:42:43,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479609586] [2024-11-07 01:42:43,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:43,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:43,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:42:43,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:42:43,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 01:42:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:43,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 01:42:43,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:42:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 01:42:43,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:42:43,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479609586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:43,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:42:43,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-07 01:42:43,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639268223] [2024-11-07 01:42:43,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:43,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:42:43,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:43,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:42:43,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:43,368 INFO L87 Difference]: Start difference. First operand 7127 states and 9248 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 01:42:43,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:43,858 INFO L93 Difference]: Finished difference Result 7824 states and 10152 transitions. [2024-11-07 01:42:43,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:42:43,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-07 01:42:43,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:43,886 INFO L225 Difference]: With dead ends: 7824 [2024-11-07 01:42:43,886 INFO L226 Difference]: Without dead ends: 7005 [2024-11-07 01:42:43,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:43,891 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 241 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:43,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 386 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:42:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7005 states. [2024-11-07 01:42:44,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7005 to 6990. [2024-11-07 01:42:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6990 states, 5988 states have (on average 1.3042752171008685) internal successors, (7810), 6057 states have internal predecessors, (7810), 589 states have call successors, (589), 377 states have call predecessors, (589), 411 states have return successors, (669), 557 states have call predecessors, (669), 588 states have call successors, (669) [2024-11-07 01:42:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6990 states to 6990 states and 9068 transitions. [2024-11-07 01:42:44,566 INFO L78 Accepts]: Start accepts. Automaton has 6990 states and 9068 transitions. Word has length 88 [2024-11-07 01:42:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:44,566 INFO L471 AbstractCegarLoop]: Abstraction has 6990 states and 9068 transitions. [2024-11-07 01:42:44,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 01:42:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 6990 states and 9068 transitions. [2024-11-07 01:42:44,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 01:42:44,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:44,570 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:42:44,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 01:42:44,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:44,770 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:44,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:44,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1699839397, now seen corresponding path program 1 times [2024-11-07 01:42:44,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:44,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91000030] [2024-11-07 01:42:44,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:44,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:44,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:42:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:44,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 01:42:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:44,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 01:42:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:44,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 01:42:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 01:42:44,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:44,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91000030] [2024-11-07 01:42:44,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91000030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:42:44,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389659881] [2024-11-07 01:42:44,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:44,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:44,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:42:44,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:42:44,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 01:42:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:44,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:42:44,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:42:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 01:42:44,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:42:44,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389659881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:44,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:42:44,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-07 01:42:44,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097503913] [2024-11-07 01:42:44,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:44,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:42:44,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:44,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:42:44,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:44,975 INFO L87 Difference]: Start difference. First operand 6990 states and 9068 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 01:42:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:45,424 INFO L93 Difference]: Finished difference Result 7369 states and 9536 transitions. [2024-11-07 01:42:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:42:45,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2024-11-07 01:42:45,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:45,449 INFO L225 Difference]: With dead ends: 7369 [2024-11-07 01:42:45,449 INFO L226 Difference]: Without dead ends: 6069 [2024-11-07 01:42:45,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:45,455 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 62 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:45,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 582 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:42:45,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6069 states. [2024-11-07 01:42:45,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6069 to 6069. [2024-11-07 01:42:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6069 states, 5170 states have (on average 1.3125725338491296) internal successors, (6786), 5223 states have internal predecessors, (6786), 532 states have call successors, (532), 340 states have call predecessors, (532), 366 states have return successors, (577), 507 states have call predecessors, (577), 532 states have call successors, (577) [2024-11-07 01:42:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6069 states to 6069 states and 7895 transitions. [2024-11-07 01:42:45,972 INFO L78 Accepts]: Start accepts. Automaton has 6069 states and 7895 transitions. Word has length 103 [2024-11-07 01:42:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:45,973 INFO L471 AbstractCegarLoop]: Abstraction has 6069 states and 7895 transitions. [2024-11-07 01:42:45,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 01:42:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 6069 states and 7895 transitions. [2024-11-07 01:42:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 01:42:45,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:45,975 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:45,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 01:42:46,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-07 01:42:46,175 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:46,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash -230438491, now seen corresponding path program 1 times [2024-11-07 01:42:46,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:46,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677340497] [2024-11-07 01:42:46,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:46,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:46,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:46,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:46,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:46,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:46,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:42:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:46,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:42:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:46,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 01:42:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-07 01:42:46,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:46,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677340497] [2024-11-07 01:42:46,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677340497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:46,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:46,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:46,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837891688] [2024-11-07 01:42:46,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:46,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:46,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:46,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:46,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:46,401 INFO L87 Difference]: Start difference. First operand 6069 states and 7895 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:42:47,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:47,950 INFO L93 Difference]: Finished difference Result 20536 states and 26971 transitions. [2024-11-07 01:42:47,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:42:47,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 111 [2024-11-07 01:42:47,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:47,996 INFO L225 Difference]: With dead ends: 20536 [2024-11-07 01:42:47,996 INFO L226 Difference]: Without dead ends: 14482 [2024-11-07 01:42:48,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-07 01:42:48,013 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 584 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:48,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 487 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:42:48,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14482 states. [2024-11-07 01:42:49,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14482 to 12288. [2024-11-07 01:42:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12288 states, 10440 states have (on average 1.2944444444444445) internal successors, (13514), 10590 states have internal predecessors, (13514), 1039 states have call successors, (1039), 676 states have call predecessors, (1039), 808 states have return successors, (1421), 1025 states have call predecessors, (1421), 1039 states have call successors, (1421) [2024-11-07 01:42:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12288 states to 12288 states and 15974 transitions. [2024-11-07 01:42:49,036 INFO L78 Accepts]: Start accepts. Automaton has 12288 states and 15974 transitions. Word has length 111 [2024-11-07 01:42:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:49,036 INFO L471 AbstractCegarLoop]: Abstraction has 12288 states and 15974 transitions. [2024-11-07 01:42:49,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:42:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 12288 states and 15974 transitions. [2024-11-07 01:42:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 01:42:49,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:49,040 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:49,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 01:42:49,040 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:49,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:49,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2097147165, now seen corresponding path program 1 times [2024-11-07 01:42:49,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:49,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731079199] [2024-11-07 01:42:49,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:49,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:49,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:49,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:49,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:42:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:49,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:42:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:49,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 01:42:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-07 01:42:49,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:49,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731079199] [2024-11-07 01:42:49,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731079199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:49,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:49,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:42:49,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987713678] [2024-11-07 01:42:49,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:49,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:42:49,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:49,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:42:49,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:42:49,113 INFO L87 Difference]: Start difference. First operand 12288 states and 15974 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:42:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:50,412 INFO L93 Difference]: Finished difference Result 24450 states and 31741 transitions. [2024-11-07 01:42:50,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:42:50,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 111 [2024-11-07 01:42:50,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:50,449 INFO L225 Difference]: With dead ends: 24450 [2024-11-07 01:42:50,449 INFO L226 Difference]: Without dead ends: 12177 [2024-11-07 01:42:50,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:42:50,467 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 370 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:50,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 259 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:42:50,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2024-11-07 01:42:51,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 10169. [2024-11-07 01:42:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10169 states, 8658 states have (on average 1.2918687918687919) internal successors, (11185), 8787 states have internal predecessors, (11185), 840 states have call successors, (840), 548 states have call predecessors, (840), 670 states have return successors, (1145), 835 states have call predecessors, (1145), 840 states have call successors, (1145) [2024-11-07 01:42:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 13170 transitions. [2024-11-07 01:42:51,278 INFO L78 Accepts]: Start accepts. Automaton has 10169 states and 13170 transitions. Word has length 111 [2024-11-07 01:42:51,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:51,278 INFO L471 AbstractCegarLoop]: Abstraction has 10169 states and 13170 transitions. [2024-11-07 01:42:51,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:42:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 10169 states and 13170 transitions. [2024-11-07 01:42:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 01:42:51,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:51,282 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:51,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 01:42:51,283 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:51,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash 118993632, now seen corresponding path program 1 times [2024-11-07 01:42:51,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:51,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619019288] [2024-11-07 01:42:51,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:51,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:42:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:42:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 01:42:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-07 01:42:51,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:51,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619019288] [2024-11-07 01:42:51,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619019288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:51,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:51,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:51,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874305514] [2024-11-07 01:42:51,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:51,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:51,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:51,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:51,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:51,441 INFO L87 Difference]: Start difference. First operand 10169 states and 13170 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:42:54,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:54,047 INFO L93 Difference]: Finished difference Result 34199 states and 44450 transitions. [2024-11-07 01:42:54,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:42:54,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 113 [2024-11-07 01:42:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:54,136 INFO L225 Difference]: With dead ends: 34199 [2024-11-07 01:42:54,137 INFO L226 Difference]: Without dead ends: 24045 [2024-11-07 01:42:54,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-07 01:42:54,156 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 459 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:54,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 635 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:42:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24045 states. [2024-11-07 01:42:55,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24045 to 20115. [2024-11-07 01:42:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20115 states, 16969 states have (on average 1.2809829689433674) internal successors, (21737), 17327 states have internal predecessors, (21737), 1639 states have call successors, (1639), 1088 states have call predecessors, (1639), 1506 states have return successors, (2627), 1703 states have call predecessors, (2627), 1639 states have call successors, (2627) [2024-11-07 01:42:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20115 states to 20115 states and 26003 transitions. [2024-11-07 01:42:55,718 INFO L78 Accepts]: Start accepts. Automaton has 20115 states and 26003 transitions. Word has length 113 [2024-11-07 01:42:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:55,718 INFO L471 AbstractCegarLoop]: Abstraction has 20115 states and 26003 transitions. [2024-11-07 01:42:55,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:42:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 20115 states and 26003 transitions. [2024-11-07 01:42:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 01:42:55,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:55,724 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:55,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 01:42:55,724 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:55,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:55,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1914400414, now seen corresponding path program 1 times [2024-11-07 01:42:55,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:55,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300325011] [2024-11-07 01:42:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:55,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:55,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:55,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:55,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:55,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:55,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:55,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:42:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:55,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:42:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:55,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 01:42:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-07 01:42:55,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:55,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300325011] [2024-11-07 01:42:55,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300325011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:55,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:55,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:42:55,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330779858] [2024-11-07 01:42:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:55,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:42:55,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:55,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:42:55,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:42:55,783 INFO L87 Difference]: Start difference. First operand 20115 states and 26003 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:42:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:57,816 INFO L93 Difference]: Finished difference Result 40006 states and 51764 transitions. [2024-11-07 01:42:57,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:42:57,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 113 [2024-11-07 01:42:57,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:57,876 INFO L225 Difference]: With dead ends: 40006 [2024-11-07 01:42:57,876 INFO L226 Difference]: Without dead ends: 19906 [2024-11-07 01:42:57,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:42:57,897 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 368 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:57,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 257 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:42:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19906 states. [2024-11-07 01:42:59,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19906 to 16651. [2024-11-07 01:42:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16651 states, 14062 states have (on average 1.282463376475608) internal successors, (18034), 14371 states have internal predecessors, (18034), 1330 states have call successors, (1330), 884 states have call predecessors, (1330), 1258 states have return successors, (2173), 1397 states have call predecessors, (2173), 1330 states have call successors, (2173) [2024-11-07 01:42:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16651 states to 16651 states and 21537 transitions. [2024-11-07 01:42:59,366 INFO L78 Accepts]: Start accepts. Automaton has 16651 states and 21537 transitions. Word has length 113 [2024-11-07 01:42:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:59,366 INFO L471 AbstractCegarLoop]: Abstraction has 16651 states and 21537 transitions. [2024-11-07 01:42:59,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:42:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 16651 states and 21537 transitions. [2024-11-07 01:42:59,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 01:42:59,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:59,371 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:59,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 01:42:59,371 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:59,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash -668270299, now seen corresponding path program 1 times [2024-11-07 01:42:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:59,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127434777] [2024-11-07 01:42:59,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:59,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:59,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:59,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:42:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:59,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:42:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:59,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:42:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:59,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:42:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:59,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:42:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:59,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:42:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 01:42:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-07 01:42:59,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:59,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127434777] [2024-11-07 01:42:59,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127434777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:59,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:59,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:59,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768131059] [2024-11-07 01:42:59,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:59,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:59,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:59,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:59,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:59,488 INFO L87 Difference]: Start difference. First operand 16651 states and 21537 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:43:03,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:43:03,654 INFO L93 Difference]: Finished difference Result 51887 states and 68415 transitions. [2024-11-07 01:43:03,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 01:43:03,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 115 [2024-11-07 01:43:03,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:43:03,745 INFO L225 Difference]: With dead ends: 51887 [2024-11-07 01:43:03,745 INFO L226 Difference]: Without dead ends: 28469 [2024-11-07 01:43:03,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-11-07 01:43:03,785 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1511 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:43:03,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 716 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:43:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28469 states. [2024-11-07 01:43:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28469 to 25455. [2024-11-07 01:43:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25455 states, 21659 states have (on average 1.2646936608338335) internal successors, (27392), 22146 states have internal predecessors, (27392), 1885 states have call successors, (1885), 1280 states have call predecessors, (1885), 1910 states have return successors, (3361), 2030 states have call predecessors, (3361), 1885 states have call successors, (3361) [2024-11-07 01:43:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25455 states to 25455 states and 32638 transitions. [2024-11-07 01:43:06,025 INFO L78 Accepts]: Start accepts. Automaton has 25455 states and 32638 transitions. Word has length 115 [2024-11-07 01:43:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:43:06,025 INFO L471 AbstractCegarLoop]: Abstraction has 25455 states and 32638 transitions. [2024-11-07 01:43:06,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:43:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 25455 states and 32638 transitions. [2024-11-07 01:43:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:43:06,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:43:06,044 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:06,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 01:43:06,045 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:43:06,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:43:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1853366273, now seen corresponding path program 1 times [2024-11-07 01:43:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:43:06,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904479708] [2024-11-07 01:43:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:43:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:43:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:06,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:43:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:06,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:43:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:06,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:43:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:43:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:06,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:43:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:06,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:43:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:06,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:43:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:06,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:43:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:06,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:43:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:06,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:43:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:06,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:43:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-07 01:43:06,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:43:06,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904479708] [2024-11-07 01:43:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904479708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:43:06,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080722891] [2024-11-07 01:43:06,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:43:06,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:43:06,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:43:06,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:43:06,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 01:43:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:06,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:43:06,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:43:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-07 01:43:06,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:43:06,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080722891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:43:06,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:43:06,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-07 01:43:06,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064187954] [2024-11-07 01:43:06,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:43:06,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:43:06,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:43:06,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:43:06,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:43:06,354 INFO L87 Difference]: Start difference. First operand 25455 states and 32638 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 01:43:08,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:43:08,625 INFO L93 Difference]: Finished difference Result 52794 states and 68570 transitions. [2024-11-07 01:43:08,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:43:08,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 167 [2024-11-07 01:43:08,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:43:08,710 INFO L225 Difference]: With dead ends: 52794 [2024-11-07 01:43:08,710 INFO L226 Difference]: Without dead ends: 28211 [2024-11-07 01:43:08,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:43:08,755 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 140 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:43:08,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 222 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:43:08,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28211 states. [2024-11-07 01:43:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28211 to 26315. [2024-11-07 01:43:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26315 states, 22471 states have (on average 1.2329224333585511) internal successors, (27705), 22912 states have internal predecessors, (27705), 1913 states have call successors, (1913), 1376 states have call predecessors, (1913), 1930 states have return successors, (2877), 2028 states have call predecessors, (2877), 1913 states have call successors, (2877) [2024-11-07 01:43:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26315 states to 26315 states and 32495 transitions. [2024-11-07 01:43:11,705 INFO L78 Accepts]: Start accepts. Automaton has 26315 states and 32495 transitions. Word has length 167 [2024-11-07 01:43:11,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:43:11,705 INFO L471 AbstractCegarLoop]: Abstraction has 26315 states and 32495 transitions. [2024-11-07 01:43:11,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 01:43:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 26315 states and 32495 transitions. [2024-11-07 01:43:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:43:11,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:43:11,724 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:43:11,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 01:43:11,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:43:11,925 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:43:11,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:43:11,925 INFO L85 PathProgramCache]: Analyzing trace with hash 132703646, now seen corresponding path program 1 times [2024-11-07 01:43:11,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:43:11,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505294808] [2024-11-07 01:43:11,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:43:11,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:43:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:11,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:43:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:11,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:43:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:12,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:43:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:12,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:43:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:12,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:43:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:12,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:43:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:12,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:43:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:12,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:43:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:12,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:43:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:12,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:43:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:12,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:43:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:12,030 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-07 01:43:12,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:43:12,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505294808] [2024-11-07 01:43:12,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505294808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:43:12,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179446940] [2024-11-07 01:43:12,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:43:12,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:43:12,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:43:12,033 INFO L229 MonitoredProcess]: Starting monitored process 7 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:43:12,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 01:43:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:12,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:43:12,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:43:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-07 01:43:12,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:43:12,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179446940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:43:12,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:43:12,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-07 01:43:12,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146236571] [2024-11-07 01:43:12,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:43:12,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:43:12,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:43:12,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:43:12,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:43:12,177 INFO L87 Difference]: Start difference. First operand 26315 states and 32495 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 01:43:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:43:13,897 INFO L93 Difference]: Finished difference Result 44797 states and 55344 transitions. [2024-11-07 01:43:13,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:43:13,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 167 [2024-11-07 01:43:13,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:43:13,969 INFO L225 Difference]: With dead ends: 44797 [2024-11-07 01:43:13,970 INFO L226 Difference]: Without dead ends: 24261 [2024-11-07 01:43:14,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:43:14,003 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 142 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:43:14,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 492 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:43:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24261 states. [2024-11-07 01:43:15,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24261 to 24239. [2024-11-07 01:43:15,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24239 states, 20848 states have (on average 1.228607060629317) internal successors, (25614), 21285 states have internal predecessors, (25614), 1622 states have call successors, (1622), 1216 states have call predecessors, (1622), 1768 states have return successors, (2452), 1739 states have call predecessors, (2452), 1622 states have call successors, (2452) [2024-11-07 01:43:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24239 states to 24239 states and 29688 transitions. [2024-11-07 01:43:15,883 INFO L78 Accepts]: Start accepts. Automaton has 24239 states and 29688 transitions. Word has length 167 [2024-11-07 01:43:15,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:43:15,883 INFO L471 AbstractCegarLoop]: Abstraction has 24239 states and 29688 transitions. [2024-11-07 01:43:15,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 01:43:15,884 INFO L276 IsEmpty]: Start isEmpty. Operand 24239 states and 29688 transitions. [2024-11-07 01:43:15,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:43:15,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:43:15,893 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:15,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 01:43:16,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-07 01:43:16,094 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:43:16,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:43:16,095 INFO L85 PathProgramCache]: Analyzing trace with hash 997533632, now seen corresponding path program 1 times [2024-11-07 01:43:16,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:43:16,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730692401] [2024-11-07 01:43:16,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:43:16,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:43:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:16,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:43:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:16,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:43:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:16,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:43:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:16,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:43:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:16,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:43:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:16,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:43:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:16,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:43:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:16,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:43:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:16,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:43:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:16,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:43:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:16,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:43:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:16,206 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-07 01:43:16,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:43:16,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730692401] [2024-11-07 01:43:16,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730692401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:43:16,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:43:16,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:43:16,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725771802] [2024-11-07 01:43:16,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:43:16,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:43:16,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:43:16,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:43:16,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:43:16,208 INFO L87 Difference]: Start difference. First operand 24239 states and 29688 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 4 states have internal predecessors, (105), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-07 01:43:19,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:43:19,574 INFO L93 Difference]: Finished difference Result 48171 states and 59091 transitions. [2024-11-07 01:43:19,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:43:19,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 4 states have internal predecessors, (105), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 167 [2024-11-07 01:43:19,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:43:19,666 INFO L225 Difference]: With dead ends: 48171 [2024-11-07 01:43:19,666 INFO L226 Difference]: Without dead ends: 29213 [2024-11-07 01:43:19,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:43:19,699 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 824 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:43:19,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 654 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:43:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29213 states. [2024-11-07 01:43:21,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29213 to 24239. [2024-11-07 01:43:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24239 states, 20848 states have (on average 1.2250575594781274) internal successors, (25540), 21285 states have internal predecessors, (25540), 1622 states have call successors, (1622), 1216 states have call predecessors, (1622), 1768 states have return successors, (2422), 1739 states have call predecessors, (2422), 1622 states have call successors, (2422) [2024-11-07 01:43:21,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24239 states to 24239 states and 29584 transitions. [2024-11-07 01:43:21,745 INFO L78 Accepts]: Start accepts. Automaton has 24239 states and 29584 transitions. Word has length 167 [2024-11-07 01:43:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:43:21,746 INFO L471 AbstractCegarLoop]: Abstraction has 24239 states and 29584 transitions. [2024-11-07 01:43:21,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 4 states have internal predecessors, (105), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-07 01:43:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 24239 states and 29584 transitions. [2024-11-07 01:43:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:43:21,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:43:21,754 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:21,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 01:43:21,754 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:43:21,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:43:21,755 INFO L85 PathProgramCache]: Analyzing trace with hash 911000360, now seen corresponding path program 1 times [2024-11-07 01:43:21,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:43:21,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325565614] [2024-11-07 01:43:21,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:43:21,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:43:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:21,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:43:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:21,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:43:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:21,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:43:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:21,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:43:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:21,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:43:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:21,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:43:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:21,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 01:43:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:21,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:43:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:21,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 01:43:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:21,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:43:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:21,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 01:43:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-07 01:43:21,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:43:21,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325565614] [2024-11-07 01:43:21,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325565614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:43:21,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:43:21,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:43:21,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146284869] [2024-11-07 01:43:21,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:43:21,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:43:21,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:43:21,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:43:21,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:43:21,919 INFO L87 Difference]: Start difference. First operand 24239 states and 29584 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 6 states have internal predecessors, (114), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10)