./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_SFH_test9-1.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_SFH_test9-1.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 f4a8b24485e53fece96b44fdc12e6f161e1bbffda2cd597a930f4925e148dc01 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:42:40,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:42:40,851 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:42:40,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:42:40,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:42:40,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:42:40,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:42:40,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:42:40,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:42:40,885 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:42:40,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:42:40,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:42:40,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:42:40,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:42:40,887 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:42:40,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:42:40,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:42:40,889 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:42:40,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:42:40,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:42:40,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:42:40,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:42:40,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:42:40,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:42:40,893 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:42:40,893 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:42:40,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:42:40,893 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:42:40,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:42:40,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:42:40,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:42:40,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:42:40,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:42:40,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:42:40,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:42:40,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:42:40,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:42:40,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:42:40,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:42:40,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:42:40,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:42:40,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:42:40,897 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 -> f4a8b24485e53fece96b44fdc12e6f161e1bbffda2cd597a930f4925e148dc01 [2024-10-11 16:42:41,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:42:41,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:42:41,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:42:41,123 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:42:41,123 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:42:41,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-1.i [2024-10-11 16:42:42,377 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:42:42,656 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:42:42,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-1.i [2024-10-11 16:42:42,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cbdb0ec52/877932a25f324aac93569ec04aa41112/FLAGc2daba982 [2024-10-11 16:42:42,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cbdb0ec52/877932a25f324aac93569ec04aa41112 [2024-10-11 16:42:42,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:42:42,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:42:42,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:42:42,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:42:42,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:42:42,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:42:42" (1/1) ... [2024-10-11 16:42:42,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a0cb0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:42, skipping insertion in model container [2024-10-11 16:42:42,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:42:42" (1/1) ... [2024-10-11 16:42:42,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:42:43,089 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_SFH_test9-1.i[33021,33034] [2024-10-11 16:42:43,278 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_SFH_test9-1.i[84583,84596] [2024-10-11 16:42:43,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:42:43,294 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:42:43,319 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_SFH_test9-1.i[33021,33034] [2024-10-11 16:42:43,397 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_SFH_test9-1.i[84583,84596] [2024-10-11 16:42:43,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:42:43,428 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:42:43,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:43 WrapperNode [2024-10-11 16:42:43,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:42:43,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:42:43,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:42:43,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:42:43,436 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:42:43" (1/1) ... [2024-10-11 16:42:43,472 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:42:43" (1/1) ... [2024-10-11 16:42:43,558 INFO L138 Inliner]: procedures = 177, calls = 722, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3282 [2024-10-11 16:42:43,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:42:43,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:42:43,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:42:43,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:42:43,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:43" (1/1) ... [2024-10-11 16:42:43,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:43" (1/1) ... [2024-10-11 16:42:43,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:43" (1/1) ... [2024-10-11 16:42:43,641 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-10-11 16:42:43,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:43" (1/1) ... [2024-10-11 16:42:43,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:43" (1/1) ... [2024-10-11 16:42:43,681 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:43" (1/1) ... [2024-10-11 16:42:43,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:43" (1/1) ... [2024-10-11 16:42:43,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:43" (1/1) ... [2024-10-11 16:42:43,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:43" (1/1) ... [2024-10-11 16:42:43,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:42:43,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:42:43,750 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:42:43,750 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:42:43,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:43" (1/1) ... [2024-10-11 16:42:43,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:42:43,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:42:43,781 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:42:43,783 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:42:43,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:42:43,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:42:43,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:42:43,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 16:42:43,821 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 16:42:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:42:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:42:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:42:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:42:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:42:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:42:43,822 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:42:43,822 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:42:43,822 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:42:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:42:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:42:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:42:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:42:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:42:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:42:43,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:42:43,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:42:43,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:42:43,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:42:43,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:42:43,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:42:43,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:42:43,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:42:43,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:42:43,959 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:42:43,960 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:42:46,088 INFO L? ?]: Removed 797 outVars from TransFormulas that were not future-live. [2024-10-11 16:42:46,089 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:42:46,142 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:42:46,142 INFO L314 CfgBuilder]: Removed 54 assume(true) statements. [2024-10-11 16:42:46,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:42:46 BoogieIcfgContainer [2024-10-11 16:42:46,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:42:46,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:42:46,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:42:46,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:42:46,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:42:42" (1/3) ... [2024-10-11 16:42:46,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4904581b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:42:46, skipping insertion in model container [2024-10-11 16:42:46,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:43" (2/3) ... [2024-10-11 16:42:46,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4904581b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:42:46, skipping insertion in model container [2024-10-11 16:42:46,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:42:46" (3/3) ... [2024-10-11 16:42:46,150 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test9-1.i [2024-10-11 16:42:46,164 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:42:46,165 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 16:42:46,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:42:46,249 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;@1cdbc9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:42:46,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 16:42:46,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 1366 states, 858 states have (on average 1.843822843822844) internal successors, (1582), 1360 states have internal predecessors, (1582), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-11 16:42:46,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 16:42:46,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:42:46,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:42:46,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:42:46,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:42:46,270 INFO L85 PathProgramCache]: Analyzing trace with hash 412935825, now seen corresponding path program 1 times [2024-10-11 16:42:46,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:42:46,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089393541] [2024-10-11 16:42:46,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:42:46,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:42:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:42:46,417 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:42:46,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:42:46,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089393541] [2024-10-11 16:42:46,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089393541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:42:46,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:42:46,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:42:46,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007184694] [2024-10-11 16:42:46,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:42:46,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:42:46,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:42:46,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:42:46,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:42:46,442 INFO L87 Difference]: Start difference. First operand has 1366 states, 858 states have (on average 1.843822843822844) internal successors, (1582), 1360 states have internal predecessors, (1582), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:42:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:42:46,615 INFO L93 Difference]: Finished difference Result 2731 states and 5675 transitions. [2024-10-11 16:42:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:42:46,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-10-11 16:42:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:42:46,655 INFO L225 Difference]: With dead ends: 2731 [2024-10-11 16:42:46,655 INFO L226 Difference]: Without dead ends: 1364 [2024-10-11 16:42:46,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:42:46,665 INFO L432 NwaCegarLoop]: 2524 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:42:46,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2524 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:42:46,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2024-10-11 16:42:46,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2024-10-11 16:42:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 857 states have (on average 1.7736289381563595) internal successors, (1520), 1358 states have internal predecessors, (1520), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-11 16:42:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2526 transitions. [2024-10-11 16:42:46,897 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2526 transitions. Word has length 8 [2024-10-11 16:42:46,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:42:46,898 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2526 transitions. [2024-10-11 16:42:46,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:42:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2526 transitions. [2024-10-11 16:42:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 16:42:46,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:42:46,902 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] [2024-10-11 16:42:46,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:42:46,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:42:46,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:42:46,903 INFO L85 PathProgramCache]: Analyzing trace with hash -701353719, now seen corresponding path program 1 times [2024-10-11 16:42:46,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:42:46,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156058201] [2024-10-11 16:42:46,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:42:46,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:42:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:42:47,332 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:42:47,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:42:47,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156058201] [2024-10-11 16:42:47,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156058201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:42:47,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:42:47,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:42:47,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383443060] [2024-10-11 16:42:47,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:42:47,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:42:47,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:42:47,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:42:47,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:42:47,338 INFO L87 Difference]: Start difference. First operand 1364 states and 2526 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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:42:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:42:48,022 INFO L93 Difference]: Finished difference Result 3882 states and 7281 transitions. [2024-10-11 16:42:48,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:42:48,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2024-10-11 16:42:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:42:48,038 INFO L225 Difference]: With dead ends: 3882 [2024-10-11 16:42:48,038 INFO L226 Difference]: Without dead ends: 2717 [2024-10-11 16:42:48,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:42:48,044 INFO L432 NwaCegarLoop]: 2754 mSDtfsCounter, 1507 mSDsluCounter, 4754 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 7508 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:42:48,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 7508 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:42:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2024-10-11 16:42:48,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 1366. [2024-10-11 16:42:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 859 states have (on average 1.7718277066356227) internal successors, (1522), 1360 states have internal predecessors, (1522), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-11 16:42:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 2528 transitions. [2024-10-11 16:42:48,286 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 2528 transitions. Word has length 63 [2024-10-11 16:42:48,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:42:48,287 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 2528 transitions. [2024-10-11 16:42:48,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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:42:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 2528 transitions. [2024-10-11 16:42:48,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 16:42:48,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:42:48,291 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:42:48,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:42:48,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:42:48,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:42:48,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1454497386, now seen corresponding path program 1 times [2024-10-11 16:42:48,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:42:48,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656591982] [2024-10-11 16:42:48,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:42:48,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:42:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:42:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:42:48,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:42:48,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656591982] [2024-10-11 16:42:48,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656591982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:42:48,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:42:48,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:42:48,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326348360] [2024-10-11 16:42:48,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:42:48,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:42:48,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:42:48,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:42:48,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:42:48,579 INFO L87 Difference]: Start difference. First operand 1366 states and 2528 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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:42:48,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:42:48,689 INFO L93 Difference]: Finished difference Result 2687 states and 4987 transitions. [2024-10-11 16:42:48,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:42:48,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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 139 [2024-10-11 16:42:48,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:42:48,698 INFO L225 Difference]: With dead ends: 2687 [2024-10-11 16:42:48,698 INFO L226 Difference]: Without dead ends: 1324 [2024-10-11 16:42:48,704 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:42:48,706 INFO L432 NwaCegarLoop]: 2421 mSDtfsCounter, 30 mSDsluCounter, 4825 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7246 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:42:48,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7246 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:42:48,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2024-10-11 16:42:48,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1324. [2024-10-11 16:42:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 817 states have (on average 1.7686658506731947) internal successors, (1445), 1318 states have internal predecessors, (1445), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-11 16:42:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2451 transitions. [2024-10-11 16:42:48,862 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 2451 transitions. Word has length 139 [2024-10-11 16:42:48,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:42:48,862 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 2451 transitions. [2024-10-11 16:42:48,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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:42:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 2451 transitions. [2024-10-11 16:42:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 16:42:48,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:42:48,868 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:42:48,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:42:48,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:42:48,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:42:48,869 INFO L85 PathProgramCache]: Analyzing trace with hash -566948362, now seen corresponding path program 1 times [2024-10-11 16:42:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:42:48,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893729280] [2024-10-11 16:42:48,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:42:48,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:42:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:42:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:42:49,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:42:49,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893729280] [2024-10-11 16:42:49,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893729280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:42:49,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:42:49,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:42:49,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035774382] [2024-10-11 16:42:49,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:42:49,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:42:49,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:42:49,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:42:49,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:42:49,017 INFO L87 Difference]: Start difference. First operand 1324 states and 2451 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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:42:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:42:49,151 INFO L93 Difference]: Finished difference Result 3869 states and 7222 transitions. [2024-10-11 16:42:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:42:49,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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 139 [2024-10-11 16:42:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:42:49,164 INFO L225 Difference]: With dead ends: 3869 [2024-10-11 16:42:49,164 INFO L226 Difference]: Without dead ends: 2548 [2024-10-11 16:42:49,169 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:42:49,169 INFO L432 NwaCegarLoop]: 2881 mSDtfsCounter, 1260 mSDsluCounter, 2427 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 5308 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:42:49,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 5308 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:42:49,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2024-10-11 16:42:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2546. [2024-10-11 16:42:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 1539 states have (on average 1.796621182586095) internal successors, (2765), 2540 states have internal predecessors, (2765), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-11 16:42:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 4771 transitions. [2024-10-11 16:42:49,378 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 4771 transitions. Word has length 139 [2024-10-11 16:42:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:42:49,380 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 4771 transitions. [2024-10-11 16:42:49,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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:42:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 4771 transitions. [2024-10-11 16:42:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 16:42:49,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:42:49,383 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:42:49,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:42:49,383 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:42:49,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:42:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash 876643622, now seen corresponding path program 1 times [2024-10-11 16:42:49,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:42:49,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654444227] [2024-10-11 16:42:49,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:42:49,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:42:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:42:49,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:42:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:42:49,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:42:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:42:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 16:42:49,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:42:49,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654444227] [2024-10-11 16:42:49,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654444227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:42:49,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:42:49,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:42:49,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384143679] [2024-10-11 16:42:49,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:42:49,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:42:49,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:42:49,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:42:49,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:42:49,639 INFO L87 Difference]: Start difference. First operand 2546 states and 4771 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 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:42:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:42:51,476 INFO L93 Difference]: Finished difference Result 4763 states and 9084 transitions. [2024-10-11 16:42:51,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:42:51,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 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 152 [2024-10-11 16:42:51,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:42:51,494 INFO L225 Difference]: With dead ends: 4763 [2024-10-11 16:42:51,494 INFO L226 Difference]: Without dead ends: 2464 [2024-10-11 16:42:51,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:42:51,503 INFO L432 NwaCegarLoop]: 2332 mSDtfsCounter, 37 mSDsluCounter, 4925 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 7257 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:42:51,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 7257 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1647 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 16:42:51,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2024-10-11 16:42:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2462. [2024-10-11 16:42:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2462 states, 1455 states have (on average 1.7945017182130585) internal successors, (2611), 2456 states have internal predecessors, (2611), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-11 16:42:51,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 4617 transitions. [2024-10-11 16:42:51,734 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 4617 transitions. Word has length 152 [2024-10-11 16:42:51,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:42:51,734 INFO L471 AbstractCegarLoop]: Abstraction has 2462 states and 4617 transitions. [2024-10-11 16:42:51,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 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:42:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 4617 transitions. [2024-10-11 16:42:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 16:42:51,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:42:51,736 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:42:51,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:42:51,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:42:51,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:42:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash -294870502, now seen corresponding path program 1 times [2024-10-11 16:42:51,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:42:51,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115702933] [2024-10-11 16:42:51,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:42:51,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:42:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:42:51,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:42:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:42:51,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:42:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:42:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:42:51,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:42:51,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115702933] [2024-10-11 16:42:51,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115702933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:42:51,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:42:51,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:42:51,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876334763] [2024-10-11 16:42:51,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:42:51,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:42:51,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:42:51,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:42:51,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:42:51,941 INFO L87 Difference]: Start difference. First operand 2462 states and 4617 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:42:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:42:55,517 INFO L93 Difference]: Finished difference Result 4915 states and 9225 transitions. [2024-10-11 16:42:55,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:42:55,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 152 [2024-10-11 16:42:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:42:55,531 INFO L225 Difference]: With dead ends: 4915 [2024-10-11 16:42:55,532 INFO L226 Difference]: Without dead ends: 2543 [2024-10-11 16:42:55,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:42:55,537 INFO L432 NwaCegarLoop]: 2677 mSDtfsCounter, 4921 mSDsluCounter, 3822 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 2254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5423 SdHoareTripleChecker+Valid, 6499 SdHoareTripleChecker+Invalid, 3684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2254 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:42:55,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5423 Valid, 6499 Invalid, 3684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2254 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 16:42:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2024-10-11 16:42:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 1369. [2024-10-11 16:42:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 862 states have (on average 1.7215777262180973) internal successors, (1484), 1363 states have internal predecessors, (1484), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-11 16:42:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2490 transitions. [2024-10-11 16:42:55,781 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2490 transitions. Word has length 152 [2024-10-11 16:42:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:42:55,782 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2490 transitions. [2024-10-11 16:42:55,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:42:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2490 transitions. [2024-10-11 16:42:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 16:42:55,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:42:55,783 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:42:55,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:42:55,784 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:42:55,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:42:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1387710286, now seen corresponding path program 1 times [2024-10-11 16:42:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:42:55,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457063130] [2024-10-11 16:42:55,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:42:55,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:42:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:42:56,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:42:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:42:56,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:42:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:42:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:42:56,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:42:56,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457063130] [2024-10-11 16:42:56,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457063130] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:42:56,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443190749] [2024-10-11 16:42:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:42:56,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:42:56,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:42:56,422 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:42:56,423 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:42:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:42:56,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 16:42:56,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:42:56,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 16:42:56,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:42:56,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 16:42:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:42:56,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:42:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:42:57,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443190749] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:42:57,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:42:57,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2024-10-11 16:42:57,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344632367] [2024-10-11 16:42:57,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:42:57,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 16:42:57,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:42:57,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 16:42:57,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:42:57,024 INFO L87 Difference]: Start difference. First operand 1369 states and 2490 transitions. Second operand has 12 states, 12 states have (on average 20.5) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 16:43:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:43:03,757 INFO L93 Difference]: Finished difference Result 5222 states and 9633 transitions. [2024-10-11 16:43:03,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 16:43:03,758 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.5) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 162 [2024-10-11 16:43:03,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:43:03,778 INFO L225 Difference]: With dead ends: 5222 [2024-10-11 16:43:03,778 INFO L226 Difference]: Without dead ends: 4099 [2024-10-11 16:43:03,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-11 16:43:03,781 INFO L432 NwaCegarLoop]: 1879 mSDtfsCounter, 4200 mSDsluCounter, 8891 mSDsCounter, 0 mSdLazyCounter, 6233 mSolverCounterSat, 2510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5212 SdHoareTripleChecker+Valid, 10770 SdHoareTripleChecker+Invalid, 8743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2510 IncrementalHoareTripleChecker+Valid, 6233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:43:03,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5212 Valid, 10770 Invalid, 8743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2510 Valid, 6233 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-10-11 16:43:03,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2024-10-11 16:43:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 1715. [2024-10-11 16:43:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1204 states have (on average 1.611295681063123) internal successors, (1940), 1705 states have internal predecessors, (1940), 506 states have call successors, (506), 3 states have call predecessors, (506), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2024-10-11 16:43:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2952 transitions. [2024-10-11 16:43:04,218 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2952 transitions. Word has length 162 [2024-10-11 16:43:04,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:43:04,218 INFO L471 AbstractCegarLoop]: Abstraction has 1715 states and 2952 transitions. [2024-10-11 16:43:04,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.5) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 16:43:04,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2952 transitions. [2024-10-11 16:43:04,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-10-11 16:43:04,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:43:04,222 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:04,241 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:43:04,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:43:04,422 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:43:04,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:43:04,423 INFO L85 PathProgramCache]: Analyzing trace with hash -976853931, now seen corresponding path program 1 times [2024-10-11 16:43:04,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:43:04,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497860997] [2024-10-11 16:43:04,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:04,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:43:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:06,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:43:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:06,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:43:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:43:06,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:43:06,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497860997] [2024-10-11 16:43:06,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497860997] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:43:06,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454393085] [2024-10-11 16:43:06,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:06,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:43:06,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:43:06,851 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:43:06,852 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:43:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:07,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 16:43:07,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:43:07,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 16:43:07,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:43:07,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:43:07,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:43:07,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:43:07,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 16:43:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:43:07,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:43:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:43:08,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454393085] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:43:08,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:43:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2024-10-11 16:43:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533478841] [2024-10-11 16:43:08,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:43:08,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 16:43:08,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:43:08,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 16:43:08,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2024-10-11 16:43:08,126 INFO L87 Difference]: Start difference. First operand 1715 states and 2952 transitions. Second operand has 20 states, 20 states have (on average 35.35) internal successors, (707), 19 states have internal predecessors, (707), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 16:43:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:43:23,093 INFO L93 Difference]: Finished difference Result 10550 states and 19420 transitions. [2024-10-11 16:43:23,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 16:43:23,094 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 35.35) internal successors, (707), 19 states have internal predecessors, (707), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 390 [2024-10-11 16:43:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:43:23,125 INFO L225 Difference]: With dead ends: 10550 [2024-10-11 16:43:23,125 INFO L226 Difference]: Without dead ends: 9427 [2024-10-11 16:43:23,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 776 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=216, Invalid=486, Unknown=0, NotChecked=0, Total=702 [2024-10-11 16:43:23,130 INFO L432 NwaCegarLoop]: 1879 mSDtfsCounter, 12194 mSDsluCounter, 18648 mSDsCounter, 0 mSdLazyCounter, 12506 mSolverCounterSat, 4977 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15214 SdHoareTripleChecker+Valid, 20527 SdHoareTripleChecker+Invalid, 17483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4977 IncrementalHoareTripleChecker+Valid, 12506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:43:23,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15214 Valid, 20527 Invalid, 17483 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4977 Valid, 12506 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2024-10-11 16:43:23,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9427 states. [2024-10-11 16:43:23,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9427 to 2579. [2024-10-11 16:43:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2579 states, 2062 states have (on average 1.4966052376333656) internal successors, (3086), 2563 states have internal predecessors, (3086), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-10-11 16:43:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 4110 transitions. [2024-10-11 16:43:23,953 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 4110 transitions. Word has length 390 [2024-10-11 16:43:23,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:43:23,954 INFO L471 AbstractCegarLoop]: Abstraction has 2579 states and 4110 transitions. [2024-10-11 16:43:23,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.35) internal successors, (707), 19 states have internal predecessors, (707), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 16:43:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 4110 transitions. [2024-10-11 16:43:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-10-11 16:43:23,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:43:23,971 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:23,991 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:43:24,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:43:24,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:43:24,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:43:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1561673757, now seen corresponding path program 2 times [2024-10-11 16:43:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:43:24,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058324238] [2024-10-11 16:43:24,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:24,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:43:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:32,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:43:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:32,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:43:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:43:32,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:43:32,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058324238] [2024-10-11 16:43:32,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058324238] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:43:32,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387059831] [2024-10-11 16:43:32,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 16:43:32,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:43:32,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:43:32,767 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:43:32,770 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:43:33,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 16:43:33,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 16:43:33,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 16:43:33,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:43:33,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:43:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3425 trivial. 0 not checked. [2024-10-11 16:43:33,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:43:33,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387059831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:43:33,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:43:33,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [25] total 33 [2024-10-11 16:43:33,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204273920] [2024-10-11 16:43:33,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:43:33,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:43:33,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:43:33,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:43:33,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=797, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 16:43:33,950 INFO L87 Difference]: Start difference. First operand 2579 states and 4110 transitions. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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:43:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:43:37,038 INFO L93 Difference]: Finished difference Result 4831 states and 8439 transitions. [2024-10-11 16:43:37,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:43:37,038 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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 846 [2024-10-11 16:43:37,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:43:37,049 INFO L225 Difference]: With dead ends: 4831 [2024-10-11 16:43:37,049 INFO L226 Difference]: Without dead ends: 3709 [2024-10-11 16:43:37,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 850 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 16:43:37,053 INFO L432 NwaCegarLoop]: 2636 mSDtfsCounter, 1359 mSDsluCounter, 10085 mSDsCounter, 0 mSdLazyCounter, 2918 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1862 SdHoareTripleChecker+Valid, 12721 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:43:37,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1862 Valid, 12721 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2918 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 16:43:37,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2024-10-11 16:43:37,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 2616. [2024-10-11 16:43:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2616 states, 2099 states have (on average 1.4897570271557885) internal successors, (3127), 2600 states have internal predecessors, (3127), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-10-11 16:43:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 4151 transitions. [2024-10-11 16:43:37,320 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 4151 transitions. Word has length 846 [2024-10-11 16:43:37,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:43:37,321 INFO L471 AbstractCegarLoop]: Abstraction has 2616 states and 4151 transitions. [2024-10-11 16:43:37,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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:43:37,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 4151 transitions. [2024-10-11 16:43:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2024-10-11 16:43:37,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:43:37,335 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:37,349 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:43:37,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:43:37,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:43:37,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:43:37,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2017887918, now seen corresponding path program 1 times [2024-10-11 16:43:37,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:43:37,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549268105] [2024-10-11 16:43:37,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:43:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:45,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:43:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:45,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:43:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:43:45,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:43:45,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549268105] [2024-10-11 16:43:45,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549268105] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:43:45,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130694853] [2024-10-11 16:43:45,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:45,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:43:45,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:43:45,625 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:43:45,629 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:43:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:46,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 4161 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 16:43:46,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:43:46,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 16:43:46,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:43:46,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:43:46,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:43:47,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:43:47,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:43:47,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:43:47,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:43:47,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:43:47,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:43:47,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:43:47,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 16:43:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:43:47,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:43:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:43:48,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130694853] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:43:48,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:43:48,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14, 14] total 39 [2024-10-11 16:43:48,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873167298] [2024-10-11 16:43:48,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:43:48,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-11 16:43:48,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:43:48,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-11 16:43:48,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=909, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 16:43:48,444 INFO L87 Difference]: Start difference. First operand 2616 states and 4151 transitions. Second operand has 39 states, 39 states have (on average 41.87179487179487) internal successors, (1633), 38 states have internal predecessors, (1633), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)