./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.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_BER_test9-1.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', '6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93'] 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_BER_test9-1.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 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 14:55:07,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 14:55:07,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 14:55:07,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 14:55:07,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 14:55:07,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 14:55:07,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 14:55:07,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 14:55:07,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 14:55:07,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 14:55:07,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 14:55:07,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 14:55:07,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 14:55:07,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 14:55:07,692 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 14:55:07,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 14:55:07,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 14:55:07,692 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 14:55:07,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 14:55:07,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 14:55:07,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 14:55:07,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 14:55:07,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 14:55:07,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 14:55:07,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 14:55:07,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 14:55:07,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 14:55:07,694 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 14:55:07,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 14:55:07,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 14:55:07,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 14:55:07,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 14:55:07,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 14:55:07,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 14:55:07,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 14:55:07,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 14:55:07,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 14:55:07,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 14:55:07,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 14:55:07,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 14:55:07,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 14:55:07,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 14:55:07,695 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 -> 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 [2024-11-07 14:55:07,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 14:55:07,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 14:55:08,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 14:55:08,002 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 14:55:08,002 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 14:55:08,004 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_BER_test9-1.i [2024-11-07 14:55:09,277 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 14:55:09,651 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 14:55:09,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2024-11-07 14:55:09,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/231f49bc2/3ec3f23558eb432fac669b881b7f2282/FLAG9cb992e64 [2024-11-07 14:55:09,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/231f49bc2/3ec3f23558eb432fac669b881b7f2282 [2024-11-07 14:55:09,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 14:55:09,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 14:55:09,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 14:55:09,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 14:55:09,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 14:55:09,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:55:09" (1/1) ... [2024-11-07 14:55:09,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30570f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:55:09, skipping insertion in model container [2024-11-07 14:55:09,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:55:09" (1/1) ... [2024-11-07 14:55:09,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 14:55:10,247 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_BER_test9-1.i[33021,33034] [2024-11-07 14:55:10,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_BER_test9-1.i[84583,84596] [2024-11-07 14:55:10,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 14:55:10,468 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 14:55:10,513 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_BER_test9-1.i[33021,33034] [2024-11-07 14:55:10,623 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_BER_test9-1.i[84583,84596] [2024-11-07 14:55:10,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 14:55:10,658 INFO L204 MainTranslator]: Completed translation [2024-11-07 14:55:10,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:55:10 WrapperNode [2024-11-07 14:55:10,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 14:55:10,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 14:55:10,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 14:55:10,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 14:55:10,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:55:10" (1/1) ... [2024-11-07 14:55:10,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:55:10" (1/1) ... [2024-11-07 14:55:10,802 INFO L138 Inliner]: procedures = 177, calls = 722, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3282 [2024-11-07 14:55:10,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 14:55:10,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 14:55:10,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 14:55:10,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 14:55:10,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:55:10" (1/1) ... [2024-11-07 14:55:10,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:55:10" (1/1) ... [2024-11-07 14:55:10,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:55:10" (1/1) ... [2024-11-07 14:55:10,938 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-11-07 14:55:10,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:55:10" (1/1) ... [2024-11-07 14:55:10,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:55:10" (1/1) ... [2024-11-07 14:55:11,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:55:10" (1/1) ... [2024-11-07 14:55:11,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:55:10" (1/1) ... [2024-11-07 14:55:11,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:55:10" (1/1) ... [2024-11-07 14:55:11,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:55:10" (1/1) ... [2024-11-07 14:55:11,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 14:55:11,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 14:55:11,082 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 14:55:11,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 14:55:11,083 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:55:10" (1/1) ... [2024-11-07 14:55:11,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 14:55:11,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 14:55:11,118 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 14:55:11,123 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 14:55:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 14:55:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 14:55:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 14:55:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 14:55:11,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 14:55:11,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 14:55:11,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 14:55:11,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 14:55:11,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-07 14:55:11,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-07 14:55:11,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-07 14:55:11,151 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-07 14:55:11,151 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-07 14:55:11,151 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-07 14:55:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 14:55:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 14:55:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 14:55:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 14:55:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 14:55:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 14:55:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 14:55:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 14:55:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 14:55:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 14:55:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 14:55:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 14:55:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 14:55:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 14:55:11,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 14:55:11,363 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 14:55:11,364 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 14:55:14,066 INFO L? ?]: Removed 797 outVars from TransFormulas that were not future-live. [2024-11-07 14:55:14,066 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 14:55:14,112 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 14:55:14,112 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-07 14:55:14,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:55:14 BoogieIcfgContainer [2024-11-07 14:55:14,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 14:55:14,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 14:55:14,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 14:55:14,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 14:55:14,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:55:09" (1/3) ... [2024-11-07 14:55:14,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b449d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:55:14, skipping insertion in model container [2024-11-07 14:55:14,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:55:10" (2/3) ... [2024-11-07 14:55:14,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b449d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:55:14, skipping insertion in model container [2024-11-07 14:55:14,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:55:14" (3/3) ... [2024-11-07 14:55:14,122 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-1.i [2024-11-07 14:55:14,134 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 14:55:14,135 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 14:55:14,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 14:55:14,239 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;@3a72ed4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 14:55:14,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 14:55:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 1371 states, 863 states have (on average 1.8389339513325609) internal successors, (1587), 1365 states have internal predecessors, (1587), 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 14:55:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 14:55:14,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 14:55:14,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 14:55:14,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 14:55:14,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 14:55:14,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1749759959, now seen corresponding path program 1 times [2024-11-07 14:55:14,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 14:55:14,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980942635] [2024-11-07 14:55:14,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 14:55:14,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 14:55:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:14,408 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 14:55:14,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 14:55:14,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980942635] [2024-11-07 14:55:14,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980942635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 14:55:14,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 14:55:14,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 14:55:14,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919055609] [2024-11-07 14:55:14,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 14:55:14,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 14:55:14,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 14:55:14,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 14:55:14,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 14:55:14,440 INFO L87 Difference]: Start difference. First operand has 1371 states, 863 states have (on average 1.8389339513325609) internal successors, (1587), 1365 states have internal predecessors, (1587), 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 14:55:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 14:55:14,667 INFO L93 Difference]: Finished difference Result 2740 states and 5684 transitions. [2024-11-07 14:55:14,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 14:55:14,669 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 14:55:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 14:55:14,701 INFO L225 Difference]: With dead ends: 2740 [2024-11-07 14:55:14,702 INFO L226 Difference]: Without dead ends: 1367 [2024-11-07 14:55:14,715 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 14:55:14,717 INFO L432 NwaCegarLoop]: 2533 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, 2533 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 14:55:14,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 14:55:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2024-11-07 14:55:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1367. [2024-11-07 14:55:15,092 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 14:55:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 2529 transitions. [2024-11-07 14:55:15,112 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 2529 transitions. Word has length 9 [2024-11-07 14:55:15,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 14:55:15,112 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 2529 transitions. [2024-11-07 14:55:15,113 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 14:55:15,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2529 transitions. [2024-11-07 14:55:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-07 14:55:15,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 14:55:15,118 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 14:55:15,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 14:55:15,118 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 14:55:15,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 14:55:15,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2144823555, now seen corresponding path program 1 times [2024-11-07 14:55:15,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 14:55:15,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946610697] [2024-11-07 14:55:15,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 14:55:15,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 14:55:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:15,652 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 14:55:15,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 14:55:15,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946610697] [2024-11-07 14:55:15,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946610697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 14:55:15,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 14:55:15,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 14:55:15,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992606385] [2024-11-07 14:55:15,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 14:55:15,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 14:55:15,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 14:55:15,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 14:55:15,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 14:55:15,655 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 14:55:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 14:55:16,640 INFO L93 Difference]: Finished difference Result 3887 states and 7286 transitions. [2024-11-07 14:55:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 14:55:16,644 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 14:55:16,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 14:55:16,676 INFO L225 Difference]: With dead ends: 3887 [2024-11-07 14:55:16,677 INFO L226 Difference]: Without dead ends: 2721 [2024-11-07 14:55:16,684 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 14:55:16,687 INFO L432 NwaCegarLoop]: 2755 mSDtfsCounter, 1508 mSDsluCounter, 4759 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 7514 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 14:55:16,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 7514 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 14:55:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2024-11-07 14:55:17,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 1369. [2024-11-07 14:55:17,258 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 14:55:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2531 transitions. [2024-11-07 14:55:17,276 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2531 transitions. Word has length 64 [2024-11-07 14:55:17,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 14:55:17,276 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2531 transitions. [2024-11-07 14:55:17,277 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 14:55:17,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2531 transitions. [2024-11-07 14:55:17,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 14:55:17,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 14:55:17,284 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 14:55:17,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 14:55:17,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 14:55:17,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 14:55:17,285 INFO L85 PathProgramCache]: Analyzing trace with hash 799809380, now seen corresponding path program 1 times [2024-11-07 14:55:17,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 14:55:17,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765274711] [2024-11-07 14:55:17,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 14:55:17,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 14:55:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:17,707 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 14:55:17,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 14:55:17,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765274711] [2024-11-07 14:55:17,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765274711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 14:55:17,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 14:55:17,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 14:55:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461802234] [2024-11-07 14:55:17,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 14:55:17,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 14:55:17,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 14:55:17,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 14:55:17,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 14:55:17,710 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 14:55:17,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 14:55:17,837 INFO L93 Difference]: Finished difference Result 2692 states and 4992 transitions. [2024-11-07 14:55:17,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 14:55:17,837 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 14:55:17,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 14:55:17,848 INFO L225 Difference]: With dead ends: 2692 [2024-11-07 14:55:17,849 INFO L226 Difference]: Without dead ends: 1327 [2024-11-07 14:55:17,855 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 14:55:17,856 INFO L432 NwaCegarLoop]: 2427 mSDtfsCounter, 30 mSDsluCounter, 4835 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 14:55:17,857 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 14:55:17,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2024-11-07 14:55:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2024-11-07 14:55:18,010 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 14:55:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 2454 transitions. [2024-11-07 14:55:18,021 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 2454 transitions. Word has length 140 [2024-11-07 14:55:18,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 14:55:18,022 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 2454 transitions. [2024-11-07 14:55:18,022 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 14:55:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 2454 transitions. [2024-11-07 14:55:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 14:55:18,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 14:55:18,027 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 14:55:18,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 14:55:18,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 14:55:18,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 14:55:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1221636368, now seen corresponding path program 1 times [2024-11-07 14:55:18,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 14:55:18,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422071466] [2024-11-07 14:55:18,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 14:55:18,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 14:55:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:18,271 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 14:55:18,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 14:55:18,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422071466] [2024-11-07 14:55:18,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422071466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 14:55:18,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 14:55:18,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 14:55:18,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436784726] [2024-11-07 14:55:18,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 14:55:18,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 14:55:18,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 14:55:18,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 14:55:18,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 14:55:18,273 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 14:55:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 14:55:18,483 INFO L93 Difference]: Finished difference Result 3875 states and 7228 transitions. [2024-11-07 14:55:18,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 14:55:18,483 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 14:55:18,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 14:55:18,503 INFO L225 Difference]: With dead ends: 3875 [2024-11-07 14:55:18,504 INFO L226 Difference]: Without dead ends: 2552 [2024-11-07 14:55:18,509 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 14:55:18,510 INFO L432 NwaCegarLoop]: 2900 mSDtfsCounter, 1261 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 5332 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 14:55:18,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 5332 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 14:55:18,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2024-11-07 14:55:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2550. [2024-11-07 14:55:18,829 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 14:55:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 4775 transitions. [2024-11-07 14:55:18,852 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 4775 transitions. Word has length 140 [2024-11-07 14:55:18,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 14:55:18,853 INFO L471 AbstractCegarLoop]: Abstraction has 2550 states and 4775 transitions. [2024-11-07 14:55:18,853 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 14:55:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 4775 transitions. [2024-11-07 14:55:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 14:55:18,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 14:55:18,856 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 14:55:18,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 14:55:18,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 14:55:18,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 14:55:18,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2083124984, now seen corresponding path program 1 times [2024-11-07 14:55:18,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 14:55:18,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537779986] [2024-11-07 14:55:18,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 14:55:18,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 14:55:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:19,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 14:55:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:19,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 14:55:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:19,242 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 14:55:19,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 14:55:19,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537779986] [2024-11-07 14:55:19,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537779986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 14:55:19,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 14:55:19,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 14:55:19,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577407166] [2024-11-07 14:55:19,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 14:55:19,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 14:55:19,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 14:55:19,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 14:55:19,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 14:55:19,245 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 14:55:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 14:55:21,957 INFO L93 Difference]: Finished difference Result 4770 states and 9091 transitions. [2024-11-07 14:55:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 14:55:21,957 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 14:55:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 14:55:21,981 INFO L225 Difference]: With dead ends: 4770 [2024-11-07 14:55:21,982 INFO L226 Difference]: Without dead ends: 2469 [2024-11-07 14:55:21,992 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 14:55:21,994 INFO L432 NwaCegarLoop]: 2338 mSDtfsCounter, 38 mSDsluCounter, 4941 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.5s IncrementalHoareTripleChecker+Time [2024-11-07 14:55:21,994 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.5s Time] [2024-11-07 14:55:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2024-11-07 14:55:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2466. [2024-11-07 14:55:22,282 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 14:55:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 4621 transitions. [2024-11-07 14:55:22,305 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 4621 transitions. Word has length 155 [2024-11-07 14:55:22,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 14:55:22,306 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 4621 transitions. [2024-11-07 14:55:22,306 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 14:55:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 4621 transitions. [2024-11-07 14:55:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 14:55:22,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 14:55:22,310 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 14:55:22,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 14:55:22,310 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 14:55:22,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 14:55:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1040328188, now seen corresponding path program 1 times [2024-11-07 14:55:22,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 14:55:22,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046946438] [2024-11-07 14:55:22,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 14:55:22,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 14:55:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:22,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 14:55:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:22,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 14:55:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:22,640 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 14:55:22,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 14:55:22,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046946438] [2024-11-07 14:55:22,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046946438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 14:55:22,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 14:55:22,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 14:55:22,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017762591] [2024-11-07 14:55:22,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 14:55:22,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 14:55:22,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 14:55:22,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 14:55:22,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 14:55:22,643 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 14:55:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 14:55:26,785 INFO L93 Difference]: Finished difference Result 4923 states and 9233 transitions. [2024-11-07 14:55:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 14:55:26,786 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 14:55:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 14:55:26,809 INFO L225 Difference]: With dead ends: 4923 [2024-11-07 14:55:26,809 INFO L226 Difference]: Without dead ends: 2548 [2024-11-07 14:55:26,816 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 14:55:26,818 INFO L432 NwaCegarLoop]: 2670 mSDtfsCounter, 6140 mSDsluCounter, 3836 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 2527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6642 SdHoareTripleChecker+Valid, 6506 SdHoareTripleChecker+Invalid, 3935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2527 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-07 14:55:26,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6642 Valid, 6506 Invalid, 3935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2527 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-07 14:55:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2024-11-07 14:55:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 1372. [2024-11-07 14:55:27,206 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 14:55:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2493 transitions. [2024-11-07 14:55:27,219 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2493 transitions. Word has length 155 [2024-11-07 14:55:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 14:55:27,219 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 2493 transitions. [2024-11-07 14:55:27,220 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 14:55:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2493 transitions. [2024-11-07 14:55:27,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 14:55:27,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 14:55:27,225 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 14:55:27,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 14:55:27,225 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 14:55:27,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 14:55:27,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1701468336, now seen corresponding path program 1 times [2024-11-07 14:55:27,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 14:55:27,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21759790] [2024-11-07 14:55:27,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 14:55:27,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 14:55:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:27,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 14:55:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:27,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 14:55:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:28,004 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 14:55:28,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 14:55:28,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21759790] [2024-11-07 14:55:28,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21759790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 14:55:28,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448673346] [2024-11-07 14:55:28,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 14:55:28,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 14:55:28,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 14:55:28,008 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 14:55:28,009 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 14:55:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:28,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 14:55:28,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 14:55:28,367 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 14:55:28,585 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 14:55:28,593 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 14:55:28,601 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 14:55:28,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 14:55:28,809 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 14:55:28,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448673346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 14:55:28,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 14:55:28,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2024-11-07 14:55:28,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73141481] [2024-11-07 14:55:28,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 14:55:28,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 14:55:28,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 14:55:28,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 14:55:28,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-07 14:55:28,812 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 14:55:35,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 14:55:35,892 INFO L93 Difference]: Finished difference Result 5231 states and 9642 transitions. [2024-11-07 14:55:35,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 14:55:35,893 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 14:55:35,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 14:55:35,918 INFO L225 Difference]: With dead ends: 5231 [2024-11-07 14:55:35,918 INFO L226 Difference]: Without dead ends: 4107 [2024-11-07 14:55:35,922 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 14:55:35,926 INFO L432 NwaCegarLoop]: 1885 mSDtfsCounter, 8050 mSDsluCounter, 8513 mSDsCounter, 0 mSdLazyCounter, 5434 mSolverCounterSat, 4018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9062 SdHoareTripleChecker+Valid, 10398 SdHoareTripleChecker+Invalid, 9452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4018 IncrementalHoareTripleChecker+Valid, 5434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-07 14:55:35,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9062 Valid, 10398 Invalid, 9452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4018 Valid, 5434 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-07 14:55:35,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2024-11-07 14:55:36,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 1719. [2024-11-07 14:55:36,272 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 14:55:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2956 transitions. [2024-11-07 14:55:36,284 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2956 transitions. Word has length 165 [2024-11-07 14:55:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 14:55:36,284 INFO L471 AbstractCegarLoop]: Abstraction has 1719 states and 2956 transitions. [2024-11-07 14:55:36,285 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 14:55:36,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2956 transitions. [2024-11-07 14:55:36,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-07 14:55:36,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 14:55:36,291 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 14:55:36,311 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 14:55:36,495 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 14:55:36,496 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 14:55:36,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 14:55:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1230488393, now seen corresponding path program 1 times [2024-11-07 14:55:36,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 14:55:36,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906370453] [2024-11-07 14:55:36,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 14:55:36,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 14:55:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:40,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 14:55:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:40,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 14:55:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:40,194 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 14:55:40,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 14:55:40,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906370453] [2024-11-07 14:55:40,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906370453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 14:55:40,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70066590] [2024-11-07 14:55:40,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 14:55:40,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 14:55:40,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 14:55:40,198 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 14:55:40,202 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 14:55:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:55:40,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 14:55:40,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 14:55:40,890 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 14:55:41,076 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 14:55:41,186 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 14:55:41,296 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 14:55:41,399 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 14:55:41,403 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 14:55:41,408 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 14:55:41,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 14:55:41,899 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 14:55:41,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70066590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 14:55:41,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 14:55:41,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2024-11-07 14:55:41,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664494931] [2024-11-07 14:55:41,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 14:55:41,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 14:55:41,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 14:55:41,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 14:55:41,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2024-11-07 14:55:41,903 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 14:55:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 14:55:56,544 INFO L93 Difference]: Finished difference Result 10563 states and 19433 transitions. [2024-11-07 14:55:56,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-07 14:55:56,545 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 14:55:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 14:55:56,594 INFO L225 Difference]: With dead ends: 10563 [2024-11-07 14:55:56,595 INFO L226 Difference]: Without dead ends: 9439 [2024-11-07 14:55:56,601 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 14:55:56,602 INFO L432 NwaCegarLoop]: 1885 mSDtfsCounter, 17299 mSDsluCounter, 17057 mSDsCounter, 0 mSdLazyCounter, 12929 mSolverCounterSat, 6348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20323 SdHoareTripleChecker+Valid, 18942 SdHoareTripleChecker+Invalid, 19277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6348 IncrementalHoareTripleChecker+Valid, 12929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2024-11-07 14:55:56,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20323 Valid, 18942 Invalid, 19277 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6348 Valid, 12929 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2024-11-07 14:55:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9439 states. [2024-11-07 14:55:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9439 to 2583. [2024-11-07 14:55:57,420 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 14:55:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 4114 transitions. [2024-11-07 14:55:57,439 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 4114 transitions. Word has length 393 [2024-11-07 14:55:57,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 14:55:57,440 INFO L471 AbstractCegarLoop]: Abstraction has 2583 states and 4114 transitions. [2024-11-07 14:55:57,441 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 14:55:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 4114 transitions. [2024-11-07 14:55:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-11-07 14:55:57,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 14:55:57,461 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 14:55:57,484 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 14:55:57,665 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 14:55:57,666 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 14:55:57,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 14:55:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1818928709, now seen corresponding path program 2 times [2024-11-07 14:55:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 14:55:57,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277240807] [2024-11-07 14:55:57,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 14:55:57,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 14:55:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:56:08,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 14:56:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:56:08,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 14:56:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 14:56:08,943 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 14:56:08,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 14:56:08,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277240807] [2024-11-07 14:56:08,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277240807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 14:56:08,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678860759] [2024-11-07 14:56:08,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 14:56:08,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 14:56:08,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 14:56:08,947 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 14:56:08,949 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 14:56:09,619 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 14:56:09,620 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 14:56:09,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 14:56:09,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 14:56:09,659 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 14:56:10,355 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 14:56:10,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 14:56:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678860759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 14:56:10,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 14:56:10,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [26] total 33 [2024-11-07 14:56:10,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862355971] [2024-11-07 14:56:10,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 14:56:10,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 14:56:10,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 14:56:10,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 14:56:10,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 14:56:10,358 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 14:56:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 14:56:13,815 INFO L93 Difference]: Finished difference Result 4837 states and 8445 transitions. [2024-11-07 14:56:13,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 14:56:13,815 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 14:56:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 14:56:13,841 INFO L225 Difference]: With dead ends: 4837 [2024-11-07 14:56:13,842 INFO L226 Difference]: Without dead ends: 3714 [2024-11-07 14:56:13,847 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 14:56:13,848 INFO L432 NwaCegarLoop]: 2646 mSDtfsCounter, 1360 mSDsluCounter, 10126 mSDsCounter, 0 mSdLazyCounter, 2905 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1863 SdHoareTripleChecker+Valid, 12772 SdHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-07 14:56:13,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1863 Valid, 12772 Invalid, 2906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2905 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-07 14:56:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3714 states. [2024-11-07 14:56:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3714 to 2620. [2024-11-07 14:56:14,141 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 14:56:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 4155 transitions. [2024-11-07 14:56:14,153 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 4155 transitions. Word has length 849 [2024-11-07 14:56:14,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 14:56:14,154 INFO L471 AbstractCegarLoop]: Abstraction has 2620 states and 4155 transitions. [2024-11-07 14:56:14,154 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 14:56:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 4155 transitions. [2024-11-07 14:56:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2024-11-07 14:56:14,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 14:56:14,177 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 14:56:14,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 14:56:14,377 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 14:56:14,378 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 14:56:14,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 14:56:14,379 INFO L85 PathProgramCache]: Analyzing trace with hash -557618036, now seen corresponding path program 1 times [2024-11-07 14:56:14,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 14:56:14,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078850257] [2024-11-07 14:56:14,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 14:56:14,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 14:56:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat