./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:27:53,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:27:53,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 16:27:53,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:27:53,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:27:53,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:27:53,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:27:53,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:27:53,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:27:53,588 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:27:53,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:27:53,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:27:53,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:27:53,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:27:53,601 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:27:53,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:27:53,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:27:53,602 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:27:53,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:27:53,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:27:53,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:27:53,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:27:53,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:27:53,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:27:53,604 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:27:53,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:27:53,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:27:53,605 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:27:53,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:27:53,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:27:53,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:27:53,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:27:53,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:27:53,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:27:53,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:27:53,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:27:53,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:27:53,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:27:53,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:27:53,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:27:53,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:27:53,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:27:53,609 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 [2024-10-11 16:27:53,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:27:53,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:27:53,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:27:53,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:27:53,787 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:27:53,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-10-11 16:27:55,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:27:55,280 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:27:55,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-10-11 16:27:55,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/07eff9ffa/342174e8666348659775971bd8a8d0fd/FLAG3305f8ebd [2024-10-11 16:27:55,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/07eff9ffa/342174e8666348659775971bd8a8d0fd [2024-10-11 16:27:55,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:27:55,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:27:55,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:27:55,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:27:55,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:27:55,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:27:55" (1/1) ... [2024-10-11 16:27:55,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb14726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:55, skipping insertion in model container [2024-10-11 16:27:55,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:27:55" (1/1) ... [2024-10-11 16:27:55,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:27:55,665 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[33021,33034] [2024-10-11 16:27:55,854 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[49681,49694] [2024-10-11 16:27:55,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:27:55,915 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:27:55,957 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[33021,33034] [2024-10-11 16:27:56,008 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[49681,49694] [2024-10-11 16:27:56,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:27:56,053 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:27:56,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:56 WrapperNode [2024-10-11 16:27:56,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:27:56,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:27:56,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:27:56,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:27:56,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:56" (1/1) ... [2024-10-11 16:27:56,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:56" (1/1) ... [2024-10-11 16:27:56,163 INFO L138 Inliner]: procedures = 177, calls = 472, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2351 [2024-10-11 16:27:56,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:27:56,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:27:56,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:27:56,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:27:56,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:56" (1/1) ... [2024-10-11 16:27:56,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:56" (1/1) ... [2024-10-11 16:27:56,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:56" (1/1) ... [2024-10-11 16:27:56,299 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 417, 24]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 98, 1]. [2024-10-11 16:27:56,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:56" (1/1) ... [2024-10-11 16:27:56,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:56" (1/1) ... [2024-10-11 16:27:56,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:56" (1/1) ... [2024-10-11 16:27:56,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:56" (1/1) ... [2024-10-11 16:27:56,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:56" (1/1) ... [2024-10-11 16:27:56,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:56" (1/1) ... [2024-10-11 16:27:56,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:27:56,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:27:56,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:27:56,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:27:56,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:56" (1/1) ... [2024-10-11 16:27:56,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:27:56,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:27:56,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:27:56,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:27:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:27:56,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:27:56,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:27:56,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 16:27:56,501 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 16:27:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:27:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:27:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:27:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:27:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:27:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:27:56,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:27:56,502 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:27:56,502 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:27:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:27:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:27:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:27:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:27:56,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:27:56,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:27:56,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:27:56,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:27:56,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:27:56,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:27:56,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:27:56,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:27:56,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:27:56,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:27:56,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:27:56,734 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:27:56,736 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:27:58,378 INFO L? ?]: Removed 526 outVars from TransFormulas that were not future-live. [2024-10-11 16:27:58,379 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:27:58,429 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:27:58,429 INFO L314 CfgBuilder]: Removed 100 assume(true) statements. [2024-10-11 16:27:58,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:27:58 BoogieIcfgContainer [2024-10-11 16:27:58,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:27:58,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:27:58,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:27:58,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:27:58,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:27:55" (1/3) ... [2024-10-11 16:27:58,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15995625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:27:58, skipping insertion in model container [2024-10-11 16:27:58,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:56" (2/3) ... [2024-10-11 16:27:58,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15995625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:27:58, skipping insertion in model container [2024-10-11 16:27:58,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:27:58" (3/3) ... [2024-10-11 16:27:58,439 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-3.i [2024-10-11 16:27:58,464 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:27:58,468 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 16:27:58,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:27:58,541 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;@4cb7c6b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:27:58,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 16:27:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 625 states, 609 states have (on average 1.632183908045977) internal successors, (994), 616 states have internal predecessors, (994), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 16:27:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 16:27:58,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:27:58,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:27:58,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:27:58,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:27:58,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1141857906, now seen corresponding path program 1 times [2024-10-11 16:27:58,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:27:58,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928201855] [2024-10-11 16:27:58,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:58,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:27:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:27:58,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:27:58,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928201855] [2024-10-11 16:27:58,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928201855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:27:58,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:27:58,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:27:58,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272870607] [2024-10-11 16:27:58,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:27:58,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:27:58,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:27:58,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:27:58,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:27:58,740 INFO L87 Difference]: Start difference. First operand has 625 states, 609 states have (on average 1.632183908045977) internal successors, (994), 616 states have internal predecessors, (994), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-10-11 16:27:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:27:58,921 INFO L93 Difference]: Finished difference Result 1800 states and 2944 transitions. [2024-10-11 16:27:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:27:58,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-10-11 16:27:58,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:27:58,941 INFO L225 Difference]: With dead ends: 1800 [2024-10-11 16:27:58,941 INFO L226 Difference]: Without dead ends: 1113 [2024-10-11 16:27:58,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-11 16:27:58,950 INFO L432 NwaCegarLoop]: 951 mSDtfsCounter, 786 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:27:58,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1846 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:27:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-10-11 16:27:59,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 563. [2024-10-11 16:27:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 548 states have (on average 1.4598540145985401) internal successors, (800), 554 states have internal predecessors, (800), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 16:27:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 822 transitions. [2024-10-11 16:27:59,023 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 822 transitions. Word has length 7 [2024-10-11 16:27:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:27:59,023 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 822 transitions. [2024-10-11 16:27:59,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-10-11 16:27:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 822 transitions. [2024-10-11 16:27:59,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-11 16:27:59,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:27:59,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:27:59,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:27:59,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:27:59,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:27:59,038 INFO L85 PathProgramCache]: Analyzing trace with hash 310683688, now seen corresponding path program 1 times [2024-10-11 16:27:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:27:59,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957761063] [2024-10-11 16:27:59,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:59,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:27:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:27:59,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:27:59,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957761063] [2024-10-11 16:27:59,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957761063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:27:59,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:27:59,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:27:59,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72057864] [2024-10-11 16:27:59,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:27:59,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:27:59,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:27:59,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:27:59,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:27:59,762 INFO L87 Difference]: Start difference. First operand 563 states and 822 transitions. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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-10-11 16:27:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:27:59,839 INFO L93 Difference]: Finished difference Result 1082 states and 1576 transitions. [2024-10-11 16:27:59,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:27:59,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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 207 [2024-10-11 16:27:59,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:27:59,842 INFO L225 Difference]: With dead ends: 1082 [2024-10-11 16:27:59,842 INFO L226 Difference]: Without dead ends: 521 [2024-10-11 16:27:59,843 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-10-11 16:27:59,844 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 30 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:27:59,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2131 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:27:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-10-11 16:27:59,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2024-10-11 16:27:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 506 states have (on average 1.4288537549407114) internal successors, (723), 512 states have internal predecessors, (723), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 16:27:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 745 transitions. [2024-10-11 16:27:59,868 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 745 transitions. Word has length 207 [2024-10-11 16:27:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:27:59,868 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 745 transitions. [2024-10-11 16:27:59,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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-10-11 16:27:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 745 transitions. [2024-10-11 16:27:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-11 16:27:59,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:27:59,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:27:59,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:27:59,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:27:59,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:27:59,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1228865764, now seen corresponding path program 1 times [2024-10-11 16:27:59,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:27:59,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588562697] [2024-10-11 16:27:59,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:59,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:27:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:28:00,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:28:00,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588562697] [2024-10-11 16:28:00,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588562697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:28:00,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:28:00,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:28:00,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836095398] [2024-10-11 16:28:00,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:28:00,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:28:00,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:28:00,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:28:00,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:28:00,132 INFO L87 Difference]: Start difference. First operand 521 states and 745 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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-10-11 16:28:00,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:28:00,181 INFO L93 Difference]: Finished difference Result 1127 states and 1607 transitions. [2024-10-11 16:28:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:28:00,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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 207 [2024-10-11 16:28:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:28:00,185 INFO L225 Difference]: With dead ends: 1127 [2024-10-11 16:28:00,187 INFO L226 Difference]: Without dead ends: 608 [2024-10-11 16:28:00,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-11 16:28:00,189 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 58 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:28:00,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1462 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:28:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-11 16:28:00,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-11 16:28:00,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 593 states have (on average 1.418212478920742) internal successors, (841), 599 states have internal predecessors, (841), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 16:28:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 863 transitions. [2024-10-11 16:28:00,206 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 863 transitions. Word has length 207 [2024-10-11 16:28:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:28:00,206 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 863 transitions. [2024-10-11 16:28:00,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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-10-11 16:28:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 863 transitions. [2024-10-11 16:28:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 16:28:00,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:28:00,209 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:28:00,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:28:00,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:28:00,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:28:00,212 INFO L85 PathProgramCache]: Analyzing trace with hash 499638739, now seen corresponding path program 1 times [2024-10-11 16:28:00,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:28:00,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141372017] [2024-10-11 16:28:00,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:28:00,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:28:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:00,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:28:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:00,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:28:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:28:00,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:28:00,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141372017] [2024-10-11 16:28:00,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141372017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:28:00,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:28:00,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:28:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943068105] [2024-10-11 16:28:00,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:28:00,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:28:00,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:28:00,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:28:00,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:28:00,556 INFO L87 Difference]: Start difference. First operand 608 states and 863 transitions. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 4 states have internal predecessors, (214), 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-10-11 16:28:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:28:00,884 INFO L93 Difference]: Finished difference Result 1132 states and 1617 transitions. [2024-10-11 16:28:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:28:00,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 4 states have internal predecessors, (214), 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 220 [2024-10-11 16:28:00,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:28:00,887 INFO L225 Difference]: With dead ends: 1132 [2024-10-11 16:28:00,887 INFO L226 Difference]: Without dead ends: 613 [2024-10-11 16:28:00,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10-11 16:28:00,891 INFO L432 NwaCegarLoop]: 701 mSDtfsCounter, 112 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:28:00,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 2596 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:28:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-10-11 16:28:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 608. [2024-10-11 16:28:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 593 states have (on average 1.4064080944350759) internal successors, (834), 599 states have internal predecessors, (834), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 16:28:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 856 transitions. [2024-10-11 16:28:00,904 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 856 transitions. Word has length 220 [2024-10-11 16:28:00,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:28:00,904 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 856 transitions. [2024-10-11 16:28:00,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 4 states have internal predecessors, (214), 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-10-11 16:28:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 856 transitions. [2024-10-11 16:28:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 16:28:00,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:28:00,906 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:28:00,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:28:00,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:28:00,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:28:00,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1999209567, now seen corresponding path program 1 times [2024-10-11 16:28:00,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:28:00,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685919794] [2024-10-11 16:28:00,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:28:00,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:28:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:01,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:28:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:01,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:28:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:01,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:28:01,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:28:01,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685919794] [2024-10-11 16:28:01,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685919794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:28:01,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:28:01,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:28:01,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875786704] [2024-10-11 16:28:01,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:28:01,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:28:01,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:28:01,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:28:01,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:28:01,185 INFO L87 Difference]: Start difference. First operand 608 states and 856 transitions. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 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-10-11 16:28:01,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:28:01,532 INFO L93 Difference]: Finished difference Result 1463 states and 2094 transitions. [2024-10-11 16:28:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:28:01,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 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 220 [2024-10-11 16:28:01,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:28:01,537 INFO L225 Difference]: With dead ends: 1463 [2024-10-11 16:28:01,537 INFO L226 Difference]: Without dead ends: 944 [2024-10-11 16:28:01,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:28:01,538 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 461 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:28:01,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 2428 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:28:01,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-10-11 16:28:01,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 940. [2024-10-11 16:28:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 917 states have (on average 1.4242093784078518) internal successors, (1306), 928 states have internal predecessors, (1306), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 16:28:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1344 transitions. [2024-10-11 16:28:01,560 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1344 transitions. Word has length 220 [2024-10-11 16:28:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:28:01,560 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1344 transitions. [2024-10-11 16:28:01,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 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-10-11 16:28:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1344 transitions. [2024-10-11 16:28:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 16:28:01,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:28:01,563 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:28:01,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:28:01,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:28:01,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:28:01,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1790285114, now seen corresponding path program 1 times [2024-10-11 16:28:01,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:28:01,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328301639] [2024-10-11 16:28:01,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:28:01,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:28:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:01,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:28:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:01,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:28:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:01,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 16:28:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:01,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 16:28:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:28:01,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:28:01,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328301639] [2024-10-11 16:28:01,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328301639] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:28:01,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802088534] [2024-10-11 16:28:01,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:28:01,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:28:01,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:28:01,881 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:28:01,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 16:28:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:02,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 1194 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 16:28:02,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:28:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 16:28:02,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:28:02,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802088534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:28:02,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:28:02,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 16:28:02,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842668393] [2024-10-11 16:28:02,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:28:02,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:28:02,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:28:02,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:28:02,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:28:02,387 INFO L87 Difference]: Start difference. First operand 940 states and 1344 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:28:02,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:28:02,449 INFO L93 Difference]: Finished difference Result 1297 states and 1882 transitions. [2024-10-11 16:28:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:28:02,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 233 [2024-10-11 16:28:02,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:28:02,454 INFO L225 Difference]: With dead ends: 1297 [2024-10-11 16:28:02,454 INFO L226 Difference]: Without dead ends: 980 [2024-10-11 16:28:02,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:28:02,457 INFO L432 NwaCegarLoop]: 708 mSDtfsCounter, 8 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:28:02,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1402 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:28:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2024-10-11 16:28:02,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2024-10-11 16:28:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 957 states have (on average 1.406478578892372) internal successors, (1346), 968 states have internal predecessors, (1346), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 16:28:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1384 transitions. [2024-10-11 16:28:02,479 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1384 transitions. Word has length 233 [2024-10-11 16:28:02,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:28:02,479 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1384 transitions. [2024-10-11 16:28:02,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:28:02,480 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1384 transitions. [2024-10-11 16:28:02,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 16:28:02,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:28:02,482 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:28:02,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 16:28:02,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:28:02,683 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:28:02,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:28:02,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1132874884, now seen corresponding path program 1 times [2024-10-11 16:28:02,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:28:02,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682283780] [2024-10-11 16:28:02,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:28:02,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:28:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:02,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:28:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:02,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:28:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:02,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 16:28:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:02,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 16:28:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:28:02,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:28:02,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682283780] [2024-10-11 16:28:02,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682283780] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:28:02,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027737311] [2024-10-11 16:28:02,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:28:02,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:28:02,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:28:02,949 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:28:02,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 16:28:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:03,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 16:28:03,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:28:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 16:28:03,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:28:03,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027737311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:28:03,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:28:03,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-11 16:28:03,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123098813] [2024-10-11 16:28:03,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:28:03,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:28:03,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:28:03,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:28:03,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:28:03,435 INFO L87 Difference]: Start difference. First operand 980 states and 1384 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:28:03,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:28:03,504 INFO L93 Difference]: Finished difference Result 1309 states and 1874 transitions. [2024-10-11 16:28:03,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:28:03,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 233 [2024-10-11 16:28:03,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:28:03,508 INFO L225 Difference]: With dead ends: 1309 [2024-10-11 16:28:03,508 INFO L226 Difference]: Without dead ends: 952 [2024-10-11 16:28:03,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:28:03,509 INFO L432 NwaCegarLoop]: 700 mSDtfsCounter, 105 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:28:03,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2009 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:28:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2024-10-11 16:28:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2024-10-11 16:28:03,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 929 states have (on average 1.403659849300323) internal successors, (1304), 940 states have internal predecessors, (1304), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 16:28:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1342 transitions. [2024-10-11 16:28:03,527 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1342 transitions. Word has length 233 [2024-10-11 16:28:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:28:03,528 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1342 transitions. [2024-10-11 16:28:03,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:28:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1342 transitions. [2024-10-11 16:28:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 16:28:03,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:28:03,530 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:28:03,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 16:28:03,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:28:03,735 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:28:03,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:28:03,736 INFO L85 PathProgramCache]: Analyzing trace with hash 618770990, now seen corresponding path program 1 times [2024-10-11 16:28:03,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:28:03,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861018958] [2024-10-11 16:28:03,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:28:03,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:28:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:04,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:28:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:04,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:28:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:04,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 16:28:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:04,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 16:28:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:28:04,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:28:04,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861018958] [2024-10-11 16:28:04,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861018958] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:28:04,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955373647] [2024-10-11 16:28:04,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:28:04,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:28:04,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:28:04,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:28:04,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 16:28:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:04,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 16:28:04,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:28:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:28:04,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:28:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:28:04,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955373647] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:28:04,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:28:04,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-10-11 16:28:04,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002992779] [2024-10-11 16:28:04,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:28:04,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:28:04,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:28:04,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:28:04,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:28:04,855 INFO L87 Difference]: Start difference. First operand 952 states and 1342 transitions. Second operand has 8 states, 8 states have (on average 66.875) internal successors, (535), 7 states have internal predecessors, (535), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:28:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:28:05,314 INFO L93 Difference]: Finished difference Result 2543 states and 3628 transitions. [2024-10-11 16:28:05,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:28:05,315 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 66.875) internal successors, (535), 7 states have internal predecessors, (535), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 233 [2024-10-11 16:28:05,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:28:05,322 INFO L225 Difference]: With dead ends: 2543 [2024-10-11 16:28:05,322 INFO L226 Difference]: Without dead ends: 2213 [2024-10-11 16:28:05,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:28:05,324 INFO L432 NwaCegarLoop]: 757 mSDtfsCounter, 3304 mSDsluCounter, 3170 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3351 SdHoareTripleChecker+Valid, 3927 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:28:05,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3351 Valid, 3927 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:28:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2024-10-11 16:28:05,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 1699. [2024-10-11 16:28:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1661 states have (on average 1.3877182420228777) internal successors, (2305), 1672 states have internal predecessors, (2305), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 26 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 16:28:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2373 transitions. [2024-10-11 16:28:05,366 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2373 transitions. Word has length 233 [2024-10-11 16:28:05,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:28:05,366 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2373 transitions. [2024-10-11 16:28:05,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 66.875) internal successors, (535), 7 states have internal predecessors, (535), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:28:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2373 transitions. [2024-10-11 16:28:05,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2024-10-11 16:28:05,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:28:05,377 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:28:05,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 16:28:05,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:28:05,578 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:28:05,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:28:05,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1961761869, now seen corresponding path program 1 times [2024-10-11 16:28:05,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:28:05,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431377450] [2024-10-11 16:28:05,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:28:05,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:28:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:06,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:28:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:06,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:28:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:06,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 16:28:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:06,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 16:28:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 4 proven. 534 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2024-10-11 16:28:06,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:28:06,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431377450] [2024-10-11 16:28:06,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431377450] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:28:06,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520041180] [2024-10-11 16:28:06,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:28:06,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:28:06,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:28:06,890 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:28:06,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 16:28:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:28:07,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 16:28:07,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:28:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:28:08,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:28:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:28:09,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520041180] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:28:09,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:28:09,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-10-11 16:28:09,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273749629] [2024-10-11 16:28:09,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:28:09,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 16:28:09,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:28:09,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 16:28:09,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2024-10-11 16:28:09,135 INFO L87 Difference]: Start difference. First operand 1699 states and 2373 transitions. Second operand has 17 states, 17 states have (on average 98.05882352941177) internal successors, (1667), 16 states have internal predecessors, (1667), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 16:28:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:28:19,002 INFO L93 Difference]: Finished difference Result 16924 states and 24097 transitions. [2024-10-11 16:28:19,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-11 16:28:19,003 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 98.05882352941177) internal successors, (1667), 16 states have internal predecessors, (1667), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 671 [2024-10-11 16:28:19,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:28:19,064 INFO L225 Difference]: With dead ends: 16924 [2024-10-11 16:28:19,064 INFO L226 Difference]: Without dead ends: 15844 [2024-10-11 16:28:19,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1408 GetRequests, 1339 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1242, Invalid=3728, Unknown=0, NotChecked=0, Total=4970 [2024-10-11 16:28:19,076 INFO L432 NwaCegarLoop]: 1662 mSDtfsCounter, 41200 mSDsluCounter, 16618 mSDsCounter, 0 mSdLazyCounter, 2749 mSolverCounterSat, 668 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41200 SdHoareTripleChecker+Valid, 18280 SdHoareTripleChecker+Invalid, 3417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 668 IncrementalHoareTripleChecker+Valid, 2749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:28:19,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41200 Valid, 18280 Invalid, 3417 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [668 Valid, 2749 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-10-11 16:28:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15844 states. [2024-10-11 16:28:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15844 to 9436. [2024-10-11 16:28:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9436 states, 9306 states have (on average 1.3852353320438426) internal successors, (12891), 9322 states have internal predecessors, (12891), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) [2024-10-11 16:28:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9436 states to 9436 states and 13143 transitions. [2024-10-11 16:28:19,431 INFO L78 Accepts]: Start accepts. Automaton has 9436 states and 13143 transitions. Word has length 671 [2024-10-11 16:28:19,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:28:19,432 INFO L471 AbstractCegarLoop]: Abstraction has 9436 states and 13143 transitions. [2024-10-11 16:28:19,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 98.05882352941177) internal successors, (1667), 16 states have internal predecessors, (1667), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 16:28:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 9436 states and 13143 transitions. [2024-10-11 16:28:19,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1558 [2024-10-11 16:28:19,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:28:19,493 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 9, 9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:28:19,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 16:28:19,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 16:28:19,694 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:28:19,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:28:19,695 INFO L85 PathProgramCache]: Analyzing trace with hash -936764175, now seen corresponding path program 1 times [2024-10-11 16:28:19,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:28:19,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190985441] [2024-10-11 16:28:19,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:28:19,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms