./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-2.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-2.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 cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:42:54,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:42:54,559 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:54,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:42:54,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:42:54,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:42:54,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:42:54,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:42:54,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:42:54,583 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:42:54,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:42:54,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:42:54,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:42:54,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:42:54,585 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:42:54,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:42:54,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:42:54,585 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:42:54,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:42:54,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:42:54,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:42:54,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:42:54,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:42:54,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:42:54,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:42:54,587 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:42:54,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:42:54,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:42:54,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:42:54,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:42:54,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:42:54,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:42:54,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:42:54,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:42:54,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:42:54,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:42:54,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:42:54,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:42:54,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:42:54,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:42:54,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:42:54,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:42:54,592 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 -> cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 [2024-10-11 16:42:54,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:42:54,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:42:54,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:42:54,820 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:42:54,820 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:42:54,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2024-10-11 16:42:55,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:42:56,247 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:42:56,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2024-10-11 16:42:56,264 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7edee1ce5/eaea905c90e34d6fb71f48b32df32bf5/FLAG8d7149e64 [2024-10-11 16:42:56,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7edee1ce5/eaea905c90e34d6fb71f48b32df32bf5 [2024-10-11 16:42:56,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:42:56,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:42:56,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:42:56,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:42:56,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:42:56,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:42:56" (1/1) ... [2024-10-11 16:42:56,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b89528e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:56, skipping insertion in model container [2024-10-11 16:42:56,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:42:56" (1/1) ... [2024-10-11 16:42:56,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:42:56,907 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-2.i[33021,33034] [2024-10-11 16:42:57,087 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-2.i[84583,84596] [2024-10-11 16:42:57,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:42:57,109 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:42:57,133 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-2.i[33021,33034] [2024-10-11 16:42:57,214 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-2.i[84583,84596] [2024-10-11 16:42:57,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:42:57,259 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:42:57,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:57 WrapperNode [2024-10-11 16:42:57,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:42:57,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:42:57,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:42:57,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:42:57,266 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:57" (1/1) ... [2024-10-11 16:42:57,307 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:57" (1/1) ... [2024-10-11 16:42:57,398 INFO L138 Inliner]: procedures = 177, calls = 773, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3448 [2024-10-11 16:42:57,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:42:57,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:42:57,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:42:57,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:42:57,407 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:57" (1/1) ... [2024-10-11 16:42:57,408 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:57" (1/1) ... [2024-10-11 16:42:57,415 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:57" (1/1) ... [2024-10-11 16:42:57,481 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-10-11 16:42:57,482 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:57" (1/1) ... [2024-10-11 16:42:57,482 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:57" (1/1) ... [2024-10-11 16:42:57,515 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:57" (1/1) ... [2024-10-11 16:42:57,536 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:57" (1/1) ... [2024-10-11 16:42:57,549 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:57" (1/1) ... [2024-10-11 16:42:57,557 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:57" (1/1) ... [2024-10-11 16:42:57,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:42:57,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:42:57,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:42:57,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:42:57,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:57" (1/1) ... [2024-10-11 16:42:57,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:42:57,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:42:57,595 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:57,597 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:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:42:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:42:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:42:57,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 16:42:57,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 16:42:57,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:42:57,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:42:57,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:42:57,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:42:57,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:42:57,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:42:57,700 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:42:57,700 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:42:57,700 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:42:57,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:42:57,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:42:57,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:42:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:42:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:42:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:42:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:42:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:42:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:42:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:42:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:42:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:42:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:42:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:42:57,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:42:57,897 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:42:57,902 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:42:59,915 INFO L? ?]: Removed 824 outVars from TransFormulas that were not future-live. [2024-10-11 16:42:59,916 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:42:59,957 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:42:59,957 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-11 16:42:59,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:42:59 BoogieIcfgContainer [2024-10-11 16:42:59,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:42:59,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:42:59,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:42:59,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:42:59,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:42:56" (1/3) ... [2024-10-11 16:42:59,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67240a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:42:59, skipping insertion in model container [2024-10-11 16:42:59,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:57" (2/3) ... [2024-10-11 16:42:59,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67240a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:42:59, skipping insertion in model container [2024-10-11 16:42:59,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:42:59" (3/3) ... [2024-10-11 16:42:59,964 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test9-2.i [2024-10-11 16:42:59,976 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:42:59,976 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 16:43:00,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:43:00,060 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;@7199dde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:43:00,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 16:43:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 1400 states, 892 states have (on average 1.836322869955157) internal successors, (1638), 1394 states have internal predecessors, (1638), 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:43:00,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 16:43:00,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:43:00,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:43:00,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:43:00,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:43:00,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1216099773, now seen corresponding path program 1 times [2024-10-11 16:43:00,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:43:00,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337045534] [2024-10-11 16:43:00,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:00,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:43:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:00,211 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:43:00,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:43:00,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337045534] [2024-10-11 16:43:00,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337045534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:43:00,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:43:00,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:43:00,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125541300] [2024-10-11 16:43:00,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:43:00,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:43:00,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:43:00,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:43:00,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:43:00,243 INFO L87 Difference]: Start difference. First operand has 1400 states, 892 states have (on average 1.836322869955157) internal successors, (1638), 1394 states have internal predecessors, (1638), 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:43:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:43:00,399 INFO L93 Difference]: Finished difference Result 2799 states and 5787 transitions. [2024-10-11 16:43:00,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:43:00,404 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:43:00,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:43:00,445 INFO L225 Difference]: With dead ends: 2799 [2024-10-11 16:43:00,446 INFO L226 Difference]: Without dead ends: 1364 [2024-10-11 16:43:00,467 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:43:00,470 INFO L432 NwaCegarLoop]: 2570 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:43:00,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2570 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:43:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2024-10-11 16:43:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2024-10-11 16:43:00,798 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:43:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2526 transitions. [2024-10-11 16:43:00,814 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2526 transitions. Word has length 8 [2024-10-11 16:43:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:43:00,815 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2526 transitions. [2024-10-11 16:43:00,815 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:43:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2526 transitions. [2024-10-11 16:43:00,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 16:43:00,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:43:00,819 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:43:00,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:43:00,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:43:00,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:43:00,820 INFO L85 PathProgramCache]: Analyzing trace with hash -271741673, now seen corresponding path program 1 times [2024-10-11 16:43:00,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:43:00,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740961055] [2024-10-11 16:43:00,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:00,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:43:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:01,144 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:43:01,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:43:01,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740961055] [2024-10-11 16:43:01,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740961055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:43:01,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:43:01,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:43:01,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745964497] [2024-10-11 16:43:01,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:43:01,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:43:01,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:43:01,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:43:01,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:43:01,150 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:43:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:43:01,880 INFO L93 Difference]: Finished difference Result 3882 states and 7281 transitions. [2024-10-11 16:43:01,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:43:01,880 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:43:01,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:43:01,897 INFO L225 Difference]: With dead ends: 3882 [2024-10-11 16:43:01,898 INFO L226 Difference]: Without dead ends: 2717 [2024-10-11 16:43:01,904 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:43:01,905 INFO L432 NwaCegarLoop]: 2740 mSDtfsCounter, 1507 mSDsluCounter, 4740 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 7480 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:43:01,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 7480 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:43:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2024-10-11 16:43:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 1366. [2024-10-11 16:43:02,262 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:43:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 2528 transitions. [2024-10-11 16:43:02,268 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 2528 transitions. Word has length 63 [2024-10-11 16:43:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:43:02,269 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 2528 transitions. [2024-10-11 16:43:02,270 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:43:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 2528 transitions. [2024-10-11 16:43:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 16:43:02,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:43:02,277 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:43:02,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:43:02,278 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:43:02,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:43:02,278 INFO L85 PathProgramCache]: Analyzing trace with hash -930208392, now seen corresponding path program 1 times [2024-10-11 16:43:02,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:43:02,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767613092] [2024-10-11 16:43:02,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:02,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:43:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:02,521 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:43:02,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:43:02,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767613092] [2024-10-11 16:43:02,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767613092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:43:02,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:43:02,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:43:02,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743377126] [2024-10-11 16:43:02,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:43:02,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:43:02,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:43:02,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:43:02,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:43:02,523 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:43:02,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:43:02,629 INFO L93 Difference]: Finished difference Result 2687 states and 4987 transitions. [2024-10-11 16:43:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:43:02,630 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:43:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:43:02,638 INFO L225 Difference]: With dead ends: 2687 [2024-10-11 16:43:02,638 INFO L226 Difference]: Without dead ends: 1324 [2024-10-11 16:43:02,642 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:43:02,644 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:43:02,645 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.1s Time] [2024-10-11 16:43:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2024-10-11 16:43:02,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1324. [2024-10-11 16:43:02,780 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:43:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2451 transitions. [2024-10-11 16:43:02,789 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 2451 transitions. Word has length 139 [2024-10-11 16:43:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:43:02,789 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 2451 transitions. [2024-10-11 16:43:02,789 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:43:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 2451 transitions. [2024-10-11 16:43:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 16:43:02,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:43:02,793 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:43:02,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:43:02,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:43:02,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:43:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1343313156, now seen corresponding path program 1 times [2024-10-11 16:43:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:43:02,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799349560] [2024-10-11 16:43:02,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:02,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:43:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:02,960 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:43:02,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:43:02,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799349560] [2024-10-11 16:43:02,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799349560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:43:02,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:43:02,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:43:02,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770571170] [2024-10-11 16:43:02,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:43:02,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:43:02,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:43:02,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:43:02,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:43:02,964 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:43:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:43:03,104 INFO L93 Difference]: Finished difference Result 3869 states and 7222 transitions. [2024-10-11 16:43:03,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:43:03,104 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:43:03,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:43:03,119 INFO L225 Difference]: With dead ends: 3869 [2024-10-11 16:43:03,119 INFO L226 Difference]: Without dead ends: 2548 [2024-10-11 16:43:03,125 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:43:03,126 INFO L432 NwaCegarLoop]: 2895 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, 5322 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:43:03,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 5322 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:43:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2024-10-11 16:43:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2546. [2024-10-11 16:43:03,361 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:43:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 4771 transitions. [2024-10-11 16:43:03,375 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 4771 transitions. Word has length 139 [2024-10-11 16:43:03,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:43:03,376 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 4771 transitions. [2024-10-11 16:43:03,376 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:43:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 4771 transitions. [2024-10-11 16:43:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 16:43:03,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:43:03,379 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:43:03,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:43:03,379 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:43:03,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:43:03,379 INFO L85 PathProgramCache]: Analyzing trace with hash 551944948, now seen corresponding path program 1 times [2024-10-11 16:43:03,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:43:03,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895353223] [2024-10-11 16:43:03,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:03,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:43:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:03,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:43:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:03,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:43:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:03,643 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:43:03,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:43:03,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895353223] [2024-10-11 16:43:03,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895353223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:43:03,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:43:03,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:43:03,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514608442] [2024-10-11 16:43:03,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:43:03,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:43:03,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:43:03,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:43:03,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:43:03,645 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:43:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:43:05,552 INFO L93 Difference]: Finished difference Result 4763 states and 9084 transitions. [2024-10-11 16:43:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:43:05,552 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:43:05,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:43:05,567 INFO L225 Difference]: With dead ends: 4763 [2024-10-11 16:43:05,567 INFO L226 Difference]: Without dead ends: 2464 [2024-10-11 16:43:05,574 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:43:05,575 INFO L432 NwaCegarLoop]: 2332 mSDtfsCounter, 37 mSDsluCounter, 4925 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:43:05,575 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.8s Time] [2024-10-11 16:43:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2024-10-11 16:43:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2462. [2024-10-11 16:43:05,776 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:43:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 4617 transitions. [2024-10-11 16:43:05,787 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 4617 transitions. Word has length 152 [2024-10-11 16:43:05,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:43:05,788 INFO L471 AbstractCegarLoop]: Abstraction has 2462 states and 4617 transitions. [2024-10-11 16:43:05,788 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:43:05,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 4617 transitions. [2024-10-11 16:43:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 16:43:05,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:43:05,789 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:43:05,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:43:05,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:43:05,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:43:05,790 INFO L85 PathProgramCache]: Analyzing trace with hash -619569176, now seen corresponding path program 1 times [2024-10-11 16:43:05,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:43:05,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973925106] [2024-10-11 16:43:05,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:05,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:43:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:06,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:43:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:06,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:43:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:06,026 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:43:06,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:43:06,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973925106] [2024-10-11 16:43:06,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973925106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:43:06,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:43:06,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:43:06,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449057651] [2024-10-11 16:43:06,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:43:06,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:43:06,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:43:06,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:43:06,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:43:06,034 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:43:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:43:09,376 INFO L93 Difference]: Finished difference Result 4915 states and 9225 transitions. [2024-10-11 16:43:09,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:43:09,377 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:43:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:43:09,393 INFO L225 Difference]: With dead ends: 4915 [2024-10-11 16:43:09,394 INFO L226 Difference]: Without dead ends: 2543 [2024-10-11 16:43:09,399 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:43:09,404 INFO L432 NwaCegarLoop]: 2686 mSDtfsCounter, 6050 mSDsluCounter, 3847 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 2541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6552 SdHoareTripleChecker+Valid, 6533 SdHoareTripleChecker+Invalid, 3979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2541 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:43:09,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6552 Valid, 6533 Invalid, 3979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2541 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 16:43:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2024-10-11 16:43:09,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 1369. [2024-10-11 16:43:09,605 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:43:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2490 transitions. [2024-10-11 16:43:09,611 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2490 transitions. Word has length 152 [2024-10-11 16:43:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:43:09,611 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2490 transitions. [2024-10-11 16:43:09,611 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:43:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2490 transitions. [2024-10-11 16:43:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 16:43:09,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:43:09,613 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:43:09,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:43:09,613 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:43:09,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:43:09,613 INFO L85 PathProgramCache]: Analyzing trace with hash -261366884, now seen corresponding path program 1 times [2024-10-11 16:43:09,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:43:09,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418297126] [2024-10-11 16:43:09,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:09,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:43:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:10,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:43:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:10,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:43:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:10,157 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:43:10,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:43:10,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418297126] [2024-10-11 16:43:10,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418297126] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:43:10,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047996387] [2024-10-11 16:43:10,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:10,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:43:10,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:43:10,160 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:43:10,161 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:43:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:10,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 16:43:10,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:43:10,456 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:10,613 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:10,617 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:10,623 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:43:10,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:43:10,754 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:43:10,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047996387] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:43:10,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:43:10,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2024-10-11 16:43:10,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088422146] [2024-10-11 16:43:10,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:43:10,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 16:43:10,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:43:10,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 16:43:10,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:43:10,757 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:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:43:16,967 INFO L93 Difference]: Finished difference Result 5222 states and 9633 transitions. [2024-10-11 16:43:16,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 16:43:16,967 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:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:43:16,984 INFO L225 Difference]: With dead ends: 5222 [2024-10-11 16:43:16,984 INFO L226 Difference]: Without dead ends: 4099 [2024-10-11 16:43:16,988 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:16,988 INFO L432 NwaCegarLoop]: 1879 mSDtfsCounter, 4315 mSDsluCounter, 10035 mSDsCounter, 0 mSdLazyCounter, 6200 mSolverCounterSat, 2512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5327 SdHoareTripleChecker+Valid, 11914 SdHoareTripleChecker+Invalid, 8712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2512 IncrementalHoareTripleChecker+Valid, 6200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:43:16,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5327 Valid, 11914 Invalid, 8712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2512 Valid, 6200 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-11 16:43:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2024-10-11 16:43:17,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 1715. [2024-10-11 16:43:17,314 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:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2952 transitions. [2024-10-11 16:43:17,320 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2952 transitions. Word has length 162 [2024-10-11 16:43:17,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:43:17,321 INFO L471 AbstractCegarLoop]: Abstraction has 1715 states and 2952 transitions. [2024-10-11 16:43:17,321 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:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2952 transitions. [2024-10-11 16:43:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-10-11 16:43:17,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:43:17,324 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:17,338 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:17,525 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:17,525 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:43:17,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:43:17,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1775265373, now seen corresponding path program 1 times [2024-10-11 16:43:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:43:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003530914] [2024-10-11 16:43:17,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:43:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:20,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:43:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:20,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:43:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:20,060 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:20,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:43:20,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003530914] [2024-10-11 16:43:20,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003530914] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:43:20,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884691787] [2024-10-11 16:43:20,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:20,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:43:20,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:43:20,065 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:20,066 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:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:20,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 16:43:20,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:43:20,547 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:20,708 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:20,788 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:20,862 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:20,933 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:20,936 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:20,940 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:20,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:43:21,294 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:21,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884691787] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:43:21,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:43:21,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2024-10-11 16:43:21,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220293050] [2024-10-11 16:43:21,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:43:21,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 16:43:21,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:43:21,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 16:43:21,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2024-10-11 16:43:21,297 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:33,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:43:33,687 INFO L93 Difference]: Finished difference Result 10550 states and 19420 transitions. [2024-10-11 16:43:33,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 16:43:33,687 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:33,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:43:33,728 INFO L225 Difference]: With dead ends: 10550 [2024-10-11 16:43:33,728 INFO L226 Difference]: Without dead ends: 9427 [2024-10-11 16:43:33,737 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:33,738 INFO L432 NwaCegarLoop]: 1879 mSDtfsCounter, 16054 mSDsluCounter, 20613 mSDsCounter, 0 mSdLazyCounter, 12095 mSolverCounterSat, 5812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19074 SdHoareTripleChecker+Valid, 22492 SdHoareTripleChecker+Invalid, 17907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5812 IncrementalHoareTripleChecker+Valid, 12095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:43:33,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19074 Valid, 22492 Invalid, 17907 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5812 Valid, 12095 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2024-10-11 16:43:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9427 states. [2024-10-11 16:43:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9427 to 2579. [2024-10-11 16:43:34,505 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:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 4110 transitions. [2024-10-11 16:43:34,513 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 4110 transitions. Word has length 390 [2024-10-11 16:43:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:43:34,514 INFO L471 AbstractCegarLoop]: Abstraction has 2579 states and 4110 transitions. [2024-10-11 16:43:34,514 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:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 4110 transitions. [2024-10-11 16:43:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-10-11 16:43:34,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:43:34,526 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:34,544 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:34,728 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:34,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:43:34,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:43:34,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1140766513, now seen corresponding path program 2 times [2024-10-11 16:43:34,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:43:34,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333385189] [2024-10-11 16:43:34,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:43:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:43,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:43:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:43,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:43:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:43,407 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:43,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:43:43,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333385189] [2024-10-11 16:43:43,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333385189] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:43:43,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962268389] [2024-10-11 16:43:43,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 16:43:43,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:43:43,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:43:43,409 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:43,415 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:43,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 16:43:43,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 16:43:43,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 16:43:43,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:43:43,984 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:44,473 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:44,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:43:44,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962268389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:43:44,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:43:44,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [26] total 33 [2024-10-11 16:43:44,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767523092] [2024-10-11 16:43:44,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:43:44,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:43:44,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:43:44,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:43:44,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 16:43:44,476 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:47,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:43:47,303 INFO L93 Difference]: Finished difference Result 4831 states and 8439 transitions. [2024-10-11 16:43:47,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:43:47,304 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:47,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:43:47,315 INFO L225 Difference]: With dead ends: 4831 [2024-10-11 16:43:47,315 INFO L226 Difference]: Without dead ends: 3709 [2024-10-11 16:43:47,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 851 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 16:43:47,321 INFO L432 NwaCegarLoop]: 2636 mSDtfsCounter, 1358 mSDsluCounter, 10088 mSDsCounter, 0 mSdLazyCounter, 2919 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1861 SdHoareTripleChecker+Valid, 12724 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:43:47,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1861 Valid, 12724 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2919 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 16:43:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2024-10-11 16:43:47,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 2616. [2024-10-11 16:43:47,578 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:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 4151 transitions. [2024-10-11 16:43:47,584 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 4151 transitions. Word has length 846 [2024-10-11 16:43:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:43:47,585 INFO L471 AbstractCegarLoop]: Abstraction has 2616 states and 4151 transitions. [2024-10-11 16:43:47,585 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:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 4151 transitions. [2024-10-11 16:43:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2024-10-11 16:43:47,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:43:47,596 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:47,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 16:43:47,800 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:47,801 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:43:47,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:43:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash -105809632, now seen corresponding path program 1 times [2024-10-11 16:43:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:43:47,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87783317] [2024-10-11 16:43:47,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:47,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:43:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:43:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:55,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:43:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:55,688 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:55,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:43:55,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87783317] [2024-10-11 16:43:55,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87783317] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:43:55,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052326054] [2024-10-11 16:43:55,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:43:55,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:43:55,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:43:55,690 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:55,691 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:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:43:56,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 4161 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 16:43:56,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:43:56,602 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:56,726 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:56,801 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:56,876 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:56,981 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:57,052 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:57,116 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:57,179 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:57,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 16:43:57,303 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:57,385 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:57,389 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:57,397 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:57,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:43:58,225 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:58,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052326054] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:43:58,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:43:58,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14, 14] total 39 [2024-10-11 16:43:58,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205871741] [2024-10-11 16:43:58,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:43:58,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-11 16:43:58,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:43:58,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-11 16:43:58,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=909, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 16:43:58,229 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)