./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i --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/uthash-2.0.2/uthash_SAX_test9-2.i', '-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', 'd993ff45e37665d9abd93530677e1201b0648bf8ee13fa84b0c68926f580d988'] 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/uthash-2.0.2/uthash_SAX_test9-2.i -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 d993ff45e37665d9abd93530677e1201b0648bf8ee13fa84b0c68926f580d988 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:09:01,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:09:01,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 15:09:01,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:09:01,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:09:01,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:09:01,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:09:01,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:09:01,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 15:09:01,992 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 15:09:01,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:09:01,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:09:01,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:09:01,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:09:01,994 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:09:01,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:09:01,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:09:01,994 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:09:01,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:09:01,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:09:01,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:09:01,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:09:01,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:09:01,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:09:01,995 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:09:01,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:09:01,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:09:01,995 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:09:01,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:09:01,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:09:01,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 15:09:01,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:09:01,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:09:01,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:09:01,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:09:01,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:09:01,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:09:01,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:09:01,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:09:01,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:09:01,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:09:01,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:09:01,996 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 -> d993ff45e37665d9abd93530677e1201b0648bf8ee13fa84b0c68926f580d988 [2024-11-07 15:09:02,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:09:02,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:09:02,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:09:02,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:09:02,287 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:09:02,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i [2024-11-07 15:09:03,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:09:03,989 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:09:03,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i [2024-11-07 15:09:04,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2e98890b/3a49fa79f42248e9b582d16f39c59a8b/FLAGdc7eb1653 [2024-11-07 15:09:04,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2e98890b/3a49fa79f42248e9b582d16f39c59a8b [2024-11-07 15:09:04,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:09:04,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:09:04,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:09:04,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:09:04,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:09:04,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:09:04" (1/1) ... [2024-11-07 15:09:04,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@94c1161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:09:04, skipping insertion in model container [2024-11-07 15:09:04,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:09:04" (1/1) ... [2024-11-07 15:09:04,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:09:04,452 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/uthash-2.0.2/uthash_SAX_test9-2.i[33021,33034] [2024-11-07 15:09:04,649 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/uthash-2.0.2/uthash_SAX_test9-2.i[84583,84596] [2024-11-07 15:09:04,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:09:04,668 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:09:04,713 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/uthash-2.0.2/uthash_SAX_test9-2.i[33021,33034] [2024-11-07 15:09:04,813 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/uthash-2.0.2/uthash_SAX_test9-2.i[84583,84596] [2024-11-07 15:09:04,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:09:04,851 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:09:04,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:09:04 WrapperNode [2024-11-07 15:09:04,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:09:04,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:09:04,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:09:04,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:09:04,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:09:04" (1/1) ... [2024-11-07 15:09:04,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:09:04" (1/1) ... [2024-11-07 15:09:05,015 INFO L138 Inliner]: procedures = 177, calls = 773, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3448 [2024-11-07 15:09:05,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:09:05,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:09:05,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:09:05,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:09:05,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:09:04" (1/1) ... [2024-11-07 15:09:05,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:09:04" (1/1) ... [2024-11-07 15:09:05,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:09:04" (1/1) ... [2024-11-07 15:09:05,169 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-07 15:09:05,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:09:04" (1/1) ... [2024-11-07 15:09:05,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:09:04" (1/1) ... [2024-11-07 15:09:05,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:09:04" (1/1) ... [2024-11-07 15:09:05,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:09:04" (1/1) ... [2024-11-07 15:09:05,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:09:04" (1/1) ... [2024-11-07 15:09:05,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:09:04" (1/1) ... [2024-11-07 15:09:05,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:09:05,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:09:05,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:09:05,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:09:05,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:09:04" (1/1) ... [2024-11-07 15:09:05,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:09:05,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:09:05,303 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 15:09:05,308 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 15:09:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 15:09:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 15:09:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 15:09:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 15:09:05,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 15:09:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 15:09:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 15:09:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 15:09:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-07 15:09:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-07 15:09:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-07 15:09:05,327 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-07 15:09:05,327 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-07 15:09:05,327 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-07 15:09:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 15:09:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:09:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 15:09:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 15:09:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 15:09:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 15:09:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 15:09:05,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 15:09:05,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 15:09:05,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 15:09:05,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 15:09:05,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 15:09:05,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 15:09:05,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:09:05,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:09:05,559 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:09:05,560 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:09:08,330 INFO L? ?]: Removed 824 outVars from TransFormulas that were not future-live. [2024-11-07 15:09:08,331 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:09:08,390 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:09:08,391 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-07 15:09:08,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:09:08 BoogieIcfgContainer [2024-11-07 15:09:08,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:09:08,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:09:08,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:09:08,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:09:08,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:09:04" (1/3) ... [2024-11-07 15:09:08,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8928fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:09:08, skipping insertion in model container [2024-11-07 15:09:08,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:09:04" (2/3) ... [2024-11-07 15:09:08,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8928fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:09:08, skipping insertion in model container [2024-11-07 15:09:08,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:09:08" (3/3) ... [2024-11-07 15:09:08,401 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test9-2.i [2024-11-07 15:09:08,413 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:09:08,413 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 15:09:08,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:09:08,519 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;@290c5dc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:09:08,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 15:09:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand has 1406 states, 898 states have (on average 1.8307349665924275) internal successors, (1644), 1400 states have internal predecessors, (1644), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-07 15:09:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 15:09:08,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:09:08,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:09:08,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 15:09:08,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:09:08,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1749759959, now seen corresponding path program 1 times [2024-11-07 15:09:08,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:09:08,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449280674] [2024-11-07 15:09:08,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:09:08,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:09:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:08,680 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 15:09:08,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:09:08,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449280674] [2024-11-07 15:09:08,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449280674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:09:08,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:09:08,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:09:08,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521457294] [2024-11-07 15:09:08,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:09:08,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 15:09:08,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:09:08,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 15:09:08,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 15:09:08,709 INFO L87 Difference]: Start difference. First operand has 1406 states, 898 states have (on average 1.8307349665924275) internal successors, (1644), 1400 states have internal predecessors, (1644), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:09:08,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:09:08,916 INFO L93 Difference]: Finished difference Result 2810 states and 5798 transitions. [2024-11-07 15:09:08,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 15:09:08,919 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-07 15:09:08,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:09:08,955 INFO L225 Difference]: With dead ends: 2810 [2024-11-07 15:09:08,956 INFO L226 Difference]: Without dead ends: 1367 [2024-11-07 15:09:08,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 15:09:08,975 INFO L432 NwaCegarLoop]: 2581 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 15:09:08,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2581 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 15:09:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2024-11-07 15:09:09,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1367. [2024-11-07 15:09:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 860 states have (on average 1.7709302325581395) internal successors, (1523), 1361 states have internal predecessors, (1523), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-07 15:09:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 2529 transitions. [2024-11-07 15:09:09,471 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 2529 transitions. Word has length 9 [2024-11-07 15:09:09,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:09:09,471 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 2529 transitions. [2024-11-07 15:09:09,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:09:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2529 transitions. [2024-11-07 15:09:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-07 15:09:09,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:09:09,478 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] [2024-11-07 15:09:09,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:09:09,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 15:09:09,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:09:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2144823555, now seen corresponding path program 1 times [2024-11-07 15:09:09,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:09:09,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848719900] [2024-11-07 15:09:09,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:09:09,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:09:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:10,010 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 15:09:10,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:09:10,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848719900] [2024-11-07 15:09:10,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848719900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:09:10,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:09:10,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:09:10,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024384485] [2024-11-07 15:09:10,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:09:10,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:09:10,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:09:10,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:09:10,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:09:10,013 INFO L87 Difference]: Start difference. First operand 1367 states and 2529 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:09:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:09:10,944 INFO L93 Difference]: Finished difference Result 3887 states and 7286 transitions. [2024-11-07 15:09:10,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 15:09:10,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-07 15:09:10,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:09:10,970 INFO L225 Difference]: With dead ends: 3887 [2024-11-07 15:09:10,970 INFO L226 Difference]: Without dead ends: 2721 [2024-11-07 15:09:10,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 15:09:10,977 INFO L432 NwaCegarLoop]: 2756 mSDtfsCounter, 1508 mSDsluCounter, 4760 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 7516 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 15:09:10,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 7516 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 15:09:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2024-11-07 15:09:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 1369. [2024-11-07 15:09:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 862 states have (on average 1.7691415313225058) internal successors, (1525), 1363 states have internal predecessors, (1525), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-07 15:09:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2531 transitions. [2024-11-07 15:09:11,477 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2531 transitions. Word has length 64 [2024-11-07 15:09:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:09:11,477 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2531 transitions. [2024-11-07 15:09:11,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:09:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2531 transitions. [2024-11-07 15:09:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 15:09:11,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:09:11,482 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:09:11,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:09:11,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 15:09:11,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:09:11,487 INFO L85 PathProgramCache]: Analyzing trace with hash 799809380, now seen corresponding path program 1 times [2024-11-07 15:09:11,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:09:11,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303560177] [2024-11-07 15:09:11,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:09:11,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:09:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:09:11,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:09:11,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303560177] [2024-11-07 15:09:11,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303560177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:09:11,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:09:11,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:09:11,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630809991] [2024-11-07 15:09:11,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:09:11,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:09:11,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:09:11,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:09:11,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:09:11,925 INFO L87 Difference]: Start difference. First operand 1369 states and 2531 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:09:12,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:09:12,059 INFO L93 Difference]: Finished difference Result 2692 states and 4992 transitions. [2024-11-07 15:09:12,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 15:09:12,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2024-11-07 15:09:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:09:12,073 INFO L225 Difference]: With dead ends: 2692 [2024-11-07 15:09:12,073 INFO L226 Difference]: Without dead ends: 1327 [2024-11-07 15:09:12,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 15:09:12,079 INFO L432 NwaCegarLoop]: 2427 mSDtfsCounter, 30 mSDsluCounter, 4835 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7262 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 15:09:12,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7262 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 15:09:12,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2024-11-07 15:09:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2024-11-07 15:09:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 820 states have (on average 1.7658536585365854) internal successors, (1448), 1321 states have internal predecessors, (1448), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-07 15:09:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 2454 transitions. [2024-11-07 15:09:12,258 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 2454 transitions. Word has length 140 [2024-11-07 15:09:12,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:09:12,259 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 2454 transitions. [2024-11-07 15:09:12,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:09:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 2454 transitions. [2024-11-07 15:09:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 15:09:12,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:09:12,261 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:09:12,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:09:12,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 15:09:12,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:09:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1221636368, now seen corresponding path program 1 times [2024-11-07 15:09:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:09:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815316915] [2024-11-07 15:09:12,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:09:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:09:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:09:12,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:09:12,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815316915] [2024-11-07 15:09:12,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815316915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:09:12,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:09:12,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:09:12,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558038254] [2024-11-07 15:09:12,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:09:12,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:09:12,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:09:12,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:09:12,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:09:12,516 INFO L87 Difference]: Start difference. First operand 1327 states and 2454 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:09:12,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:09:12,680 INFO L93 Difference]: Finished difference Result 3875 states and 7228 transitions. [2024-11-07 15:09:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:09:12,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2024-11-07 15:09:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:09:12,701 INFO L225 Difference]: With dead ends: 3875 [2024-11-07 15:09:12,701 INFO L226 Difference]: Without dead ends: 2552 [2024-11-07 15:09:12,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:09:12,709 INFO L432 NwaCegarLoop]: 2891 mSDtfsCounter, 1261 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 5323 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 15:09:12,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 5323 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 15:09:12,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2024-11-07 15:09:13,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2550. [2024-11-07 15:09:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 1543 states have (on average 1.7945560596241088) internal successors, (2769), 2544 states have internal predecessors, (2769), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-07 15:09:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 4775 transitions. [2024-11-07 15:09:13,067 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 4775 transitions. Word has length 140 [2024-11-07 15:09:13,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:09:13,072 INFO L471 AbstractCegarLoop]: Abstraction has 2550 states and 4775 transitions. [2024-11-07 15:09:13,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:09:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 4775 transitions. [2024-11-07 15:09:13,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 15:09:13,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:09:13,074 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:09:13,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:09:13,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 15:09:13,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:09:13,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1150455944, now seen corresponding path program 1 times [2024-11-07 15:09:13,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:09:13,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873357453] [2024-11-07 15:09:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:09:13,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:09:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:13,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 15:09:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:13,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 15:09:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 15:09:13,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:09:13,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873357453] [2024-11-07 15:09:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873357453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:09:13,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:09:13,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:09:13,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998879324] [2024-11-07 15:09:13,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:09:13,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 15:09:13,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:09:13,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 15:09:13,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 15:09:13,526 INFO L87 Difference]: Start difference. First operand 2550 states and 4775 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 15:09:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:09:16,115 INFO L93 Difference]: Finished difference Result 4770 states and 9091 transitions. [2024-11-07 15:09:16,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:09:16,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-07 15:09:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:09:16,139 INFO L225 Difference]: With dead ends: 4770 [2024-11-07 15:09:16,139 INFO L226 Difference]: Without dead ends: 2469 [2024-11-07 15:09:16,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:09:16,151 INFO L432 NwaCegarLoop]: 2338 mSDtfsCounter, 38 mSDsluCounter, 4941 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 7279 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:09:16,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 7279 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 15:09:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2024-11-07 15:09:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2466. [2024-11-07 15:09:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 1459 states have (on average 1.792323509252913) internal successors, (2615), 2460 states have internal predecessors, (2615), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-07 15:09:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 4621 transitions. [2024-11-07 15:09:16,522 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 4621 transitions. Word has length 155 [2024-11-07 15:09:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:09:16,523 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 4621 transitions. [2024-11-07 15:09:16,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 15:09:16,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 4621 transitions. [2024-11-07 15:09:16,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 15:09:16,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:09:16,527 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:09:16,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:09:16,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 15:09:16,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:09:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash -21058180, now seen corresponding path program 1 times [2024-11-07 15:09:16,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:09:16,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234559839] [2024-11-07 15:09:16,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:09:16,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:09:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:16,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 15:09:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:16,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 15:09:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 15:09:16,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:09:16,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234559839] [2024-11-07 15:09:16,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234559839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:09:16,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:09:16,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 15:09:16,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544893175] [2024-11-07 15:09:16,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:09:16,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:09:16,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:09:16,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:09:16,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:09:16,855 INFO L87 Difference]: Start difference. First operand 2466 states and 4621 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 15:09:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:09:21,049 INFO L93 Difference]: Finished difference Result 4923 states and 9233 transitions. [2024-11-07 15:09:21,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:09:21,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-07 15:09:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:09:21,074 INFO L225 Difference]: With dead ends: 4923 [2024-11-07 15:09:21,074 INFO L226 Difference]: Without dead ends: 2548 [2024-11-07 15:09:21,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:09:21,120 INFO L432 NwaCegarLoop]: 2696 mSDtfsCounter, 6056 mSDsluCounter, 3861 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 2533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6558 SdHoareTripleChecker+Valid, 6557 SdHoareTripleChecker+Invalid, 3966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2533 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-07 15:09:21,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6558 Valid, 6557 Invalid, 3966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2533 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-07 15:09:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2024-11-07 15:09:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 1372. [2024-11-07 15:09:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 865 states have (on average 1.7190751445086705) internal successors, (1487), 1366 states have internal predecessors, (1487), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-07 15:09:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2493 transitions. [2024-11-07 15:09:21,411 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2493 transitions. Word has length 155 [2024-11-07 15:09:21,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:09:21,411 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 2493 transitions. [2024-11-07 15:09:21,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 15:09:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2493 transitions. [2024-11-07 15:09:21,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 15:09:21,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:09:21,415 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:09:21,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:09:21,416 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 15:09:21,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:09:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2009301040, now seen corresponding path program 1 times [2024-11-07 15:09:21,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:09:21,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711831400] [2024-11-07 15:09:21,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:09:21,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:09:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:22,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 15:09:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:22,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 15:09:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 15:09:22,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:09:22,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711831400] [2024-11-07 15:09:22,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711831400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:09:22,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568553727] [2024-11-07 15:09:22,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:09:22,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:09:22,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:09:22,260 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 15:09:22,262 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 15:09:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:22,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 15:09:22,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:09:22,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 15:09:22,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-07 15:09:22,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-07 15:09:22,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 15:09:22,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 15:09:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 15:09:23,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568553727] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 15:09:23,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 15:09:23,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2024-11-07 15:09:23,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393564733] [2024-11-07 15:09:23,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 15:09:23,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 15:09:23,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:09:23,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 15:09:23,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-07 15:09:23,139 INFO L87 Difference]: Start difference. First operand 1372 states and 2493 transitions. Second operand has 12 states, 12 states have (on average 20.75) internal successors, (249), 11 states have internal predecessors, (249), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 15:09:30,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:09:30,813 INFO L93 Difference]: Finished difference Result 5231 states and 9642 transitions. [2024-11-07 15:09:30,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 15:09:30,814 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.75) internal successors, (249), 11 states have internal predecessors, (249), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 165 [2024-11-07 15:09:30,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:09:30,838 INFO L225 Difference]: With dead ends: 5231 [2024-11-07 15:09:30,838 INFO L226 Difference]: Without dead ends: 4107 [2024-11-07 15:09:30,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 327 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-07 15:09:30,843 INFO L432 NwaCegarLoop]: 1885 mSDtfsCounter, 5463 mSDsluCounter, 10625 mSDsCounter, 0 mSdLazyCounter, 6702 mSolverCounterSat, 3013 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6475 SdHoareTripleChecker+Valid, 12510 SdHoareTripleChecker+Invalid, 9715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3013 IncrementalHoareTripleChecker+Valid, 6702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:09:30,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6475 Valid, 12510 Invalid, 9715 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3013 Valid, 6702 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-07 15:09:30,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2024-11-07 15:09:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 1719. [2024-11-07 15:09:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1719 states, 1208 states have (on average 1.609271523178808) internal successors, (1944), 1709 states have internal predecessors, (1944), 506 states have call successors, (506), 3 states have call predecessors, (506), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2024-11-07 15:09:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2956 transitions. [2024-11-07 15:09:31,273 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2956 transitions. Word has length 165 [2024-11-07 15:09:31,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:09:31,274 INFO L471 AbstractCegarLoop]: Abstraction has 1719 states and 2956 transitions. [2024-11-07 15:09:31,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.75) internal successors, (249), 11 states have internal predecessors, (249), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 15:09:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2956 transitions. [2024-11-07 15:09:31,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-07 15:09:31,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:09:31,283 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:09:31,302 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 15:09:31,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:09:31,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 15:09:31,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:09:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash 145728567, now seen corresponding path program 1 times [2024-11-07 15:09:31,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:09:31,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748011829] [2024-11-07 15:09:31,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:09:31,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:09:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:35,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 15:09:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:35,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 15:09:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 15:09:35,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:09:35,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748011829] [2024-11-07 15:09:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748011829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:09:35,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991707703] [2024-11-07 15:09:35,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:09:35,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:09:35,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:09:35,282 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 15:09:35,284 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 15:09:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:09:35,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 15:09:35,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:09:35,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 15:09:36,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-07 15:09:36,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-07 15:09:36,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-07 15:09:36,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-07 15:09:36,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-07 15:09:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 15:09:36,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 15:09:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 15:09:36,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991707703] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 15:09:36,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 15:09:36,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2024-11-07 15:09:36,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346681312] [2024-11-07 15:09:36,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 15:09:36,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 15:09:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:09:36,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 15:09:36,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2024-11-07 15:09:36,901 INFO L87 Difference]: Start difference. First operand 1719 states and 2956 transitions. Second operand has 21 states, 21 states have (on average 33.857142857142854) internal successors, (711), 20 states have internal predecessors, (711), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 15:09:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:09:51,083 INFO L93 Difference]: Finished difference Result 10563 states and 19433 transitions. [2024-11-07 15:09:51,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-07 15:09:51,084 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 33.857142857142854) internal successors, (711), 20 states have internal predecessors, (711), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 393 [2024-11-07 15:09:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:09:51,147 INFO L225 Difference]: With dead ends: 10563 [2024-11-07 15:09:51,147 INFO L226 Difference]: Without dead ends: 9439 [2024-11-07 15:09:51,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 781 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2024-11-07 15:09:51,153 INFO L432 NwaCegarLoop]: 1885 mSDtfsCounter, 22111 mSDsluCounter, 15037 mSDsCounter, 0 mSdLazyCounter, 8831 mSolverCounterSat, 8352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25135 SdHoareTripleChecker+Valid, 16922 SdHoareTripleChecker+Invalid, 17183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8352 IncrementalHoareTripleChecker+Valid, 8831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:09:51,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25135 Valid, 16922 Invalid, 17183 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8352 Valid, 8831 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2024-11-07 15:09:51,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9439 states. [2024-11-07 15:09:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9439 to 2583. [2024-11-07 15:09:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2583 states, 2066 states have (on average 1.4956437560503388) internal successors, (3090), 2567 states have internal predecessors, (3090), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-11-07 15:09:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 4114 transitions. [2024-11-07 15:09:51,926 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 4114 transitions. Word has length 393 [2024-11-07 15:09:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:09:51,927 INFO L471 AbstractCegarLoop]: Abstraction has 2583 states and 4114 transitions. [2024-11-07 15:09:51,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 33.857142857142854) internal successors, (711), 20 states have internal predecessors, (711), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 15:09:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 4114 transitions. [2024-11-07 15:09:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-11-07 15:09:51,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:09:51,946 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:09:51,969 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 15:09:52,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:09:52,148 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 15:09:52,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:09:52,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1299090885, now seen corresponding path program 2 times [2024-11-07 15:09:52,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:09:52,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494170654] [2024-11-07 15:09:52,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:09:52,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:09:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:10:02,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 15:10:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:10:02,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 15:10:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:10:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 15:10:02,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:10:02,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494170654] [2024-11-07 15:10:02,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494170654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:10:02,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725453970] [2024-11-07 15:10:02,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 15:10:02,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:10:02,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:10:02,741 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 15:10:02,742 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 15:10:03,512 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 15:10:03,512 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 15:10:03,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 15:10:03,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:10:03,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 15:10:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-07 15:10:04,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:10:04,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725453970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:10:04,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 15:10:04,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [26] total 33 [2024-11-07 15:10:04,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27558439] [2024-11-07 15:10:04,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:10:04,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:10:04,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:10:04,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:10:04,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 15:10:04,345 INFO L87 Difference]: Start difference. First operand 2583 states and 4114 transitions. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 15:10:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:10:08,358 INFO L93 Difference]: Finished difference Result 4837 states and 8445 transitions. [2024-11-07 15:10:08,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:10:08,358 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 849 [2024-11-07 15:10:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:10:08,376 INFO L225 Difference]: With dead ends: 4837 [2024-11-07 15:10:08,376 INFO L226 Difference]: Without dead ends: 3714 [2024-11-07 15:10:08,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 851 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2024-11-07 15:10:08,383 INFO L432 NwaCegarLoop]: 2651 mSDtfsCounter, 1358 mSDsluCounter, 11694 mSDsCounter, 0 mSdLazyCounter, 4008 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1861 SdHoareTripleChecker+Valid, 14345 SdHoareTripleChecker+Invalid, 4009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-07 15:10:08,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1861 Valid, 14345 Invalid, 4009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4008 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-07 15:10:08,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3714 states. [2024-11-07 15:10:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3714 to 2620. [2024-11-07 15:10:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2620 states, 2103 states have (on average 1.488825487398954) internal successors, (3131), 2604 states have internal predecessors, (3131), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-11-07 15:10:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 4155 transitions. [2024-11-07 15:10:08,705 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 4155 transitions. Word has length 849 [2024-11-07 15:10:08,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:10:08,707 INFO L471 AbstractCegarLoop]: Abstraction has 2620 states and 4155 transitions. [2024-11-07 15:10:08,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 15:10:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 4155 transitions. [2024-11-07 15:10:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2024-11-07 15:10:08,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:10:08,728 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:10:08,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 15:10:08,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:10:08,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 15:10:08,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:10:08,930 INFO L85 PathProgramCache]: Analyzing trace with hash 507278604, now seen corresponding path program 1 times [2024-11-07 15:10:08,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:10:08,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138687727] [2024-11-07 15:10:08,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:10:08,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:10:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat