./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_nondet_test2-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_nondet_test2-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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:39:42,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:39:42,674 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:39:42,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:39:42,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:39:42,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:39:42,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:39:42,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:39:42,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:39:42,714 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:39:42,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:39:42,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:39:42,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:39:42,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:39:42,715 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:39:42,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:39:42,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:39:42,716 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:39:42,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:39:42,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:39:42,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:39:42,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:39:42,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:39:42,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:39:42,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:39:42,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:39:42,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:39:42,719 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:39:42,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:39:42,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:39:42,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:39:42,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:39:42,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:39:42,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:39:42,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:39:42,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:39:42,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:39:42,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:39:42,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:39:42,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:39:42,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:39:42,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:39:42,722 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-10-11 16:39:42,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:39:42,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:39:42,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:39:42,921 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:39:42,921 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:39:42,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-2.i [2024-10-11 16:39:44,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:39:44,326 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:39:44,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-2.i [2024-10-11 16:39:44,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/53fac00e3/95dcc1d1e02b4cb38f299e795966d673/FLAGd1bf2875f [2024-10-11 16:39:44,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/53fac00e3/95dcc1d1e02b4cb38f299e795966d673 [2024-10-11 16:39:44,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:39:44,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:39:44,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:39:44,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:39:44,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:39:44,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:39:44" (1/1) ... [2024-10-11 16:39:44,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54abe2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:44, skipping insertion in model container [2024-10-11 16:39:44,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:39:44" (1/1) ... [2024-10-11 16:39:44,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:39:44,740 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_nondet_test2-2.i[37435,37448] [2024-10-11 16:39:44,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:39:44,845 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:39:44,876 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_nondet_test2-2.i[37435,37448] [2024-10-11 16:39:44,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:39:44,981 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:39:44,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:44 WrapperNode [2024-10-11 16:39:44,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:39:44,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:39:44,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:39:44,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:39:44,990 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:39:44" (1/1) ... [2024-10-11 16:39:45,013 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:39:44" (1/1) ... [2024-10-11 16:39:45,065 INFO L138 Inliner]: procedures = 207, calls = 272, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1443 [2024-10-11 16:39:45,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:39:45,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:39:45,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:39:45,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:39:45,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:44" (1/1) ... [2024-10-11 16:39:45,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:44" (1/1) ... [2024-10-11 16:39:45,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:44" (1/1) ... [2024-10-11 16:39:45,190 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 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:39:45,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:44" (1/1) ... [2024-10-11 16:39:45,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:44" (1/1) ... [2024-10-11 16:39:45,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:44" (1/1) ... [2024-10-11 16:39:45,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:44" (1/1) ... [2024-10-11 16:39:45,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:44" (1/1) ... [2024-10-11 16:39:45,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:44" (1/1) ... [2024-10-11 16:39:45,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:39:45,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:39:45,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:39:45,267 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:39:45,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:44" (1/1) ... [2024-10-11 16:39:45,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:39:45,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:39:45,296 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:39:45,299 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:39:45,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:39:45,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:39:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:39:45,336 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:39:45,336 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:39:45,336 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:39:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:39:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:39:45,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:39:45,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:39:45,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:39:45,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:39:45,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:39:45,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:39:45,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:39:45,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:39:45,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:39:45,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:39:45,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:39:45,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:39:45,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:39:45,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:39:45,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:39:45,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:39:45,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:39:45,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:39:45,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:39:45,509 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:39:45,511 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:39:46,641 INFO L? ?]: Removed 321 outVars from TransFormulas that were not future-live. [2024-10-11 16:39:46,641 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:39:46,671 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:39:46,671 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-11 16:39:46,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:39:46 BoogieIcfgContainer [2024-10-11 16:39:46,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:39:46,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:39:46,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:39:46,679 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:39:46,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:39:44" (1/3) ... [2024-10-11 16:39:46,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d69c9e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:39:46, skipping insertion in model container [2024-10-11 16:39:46,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:44" (2/3) ... [2024-10-11 16:39:46,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d69c9e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:39:46, skipping insertion in model container [2024-10-11 16:39:46,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:39:46" (3/3) ... [2024-10-11 16:39:46,681 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test2-2.i [2024-10-11 16:39:46,693 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:39:46,694 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 16:39:46,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:39:46,761 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;@9942c35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:39:46,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 16:39:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 390 states have (on average 1.6282051282051282) internal successors, (635), 391 states have internal predecessors, (635), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 16:39:46,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:46,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:39:46,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:46,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:46,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1645702792, now seen corresponding path program 1 times [2024-10-11 16:39:46,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:46,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653006975] [2024-10-11 16:39:46,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:46,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:46,919 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:39:46,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:46,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653006975] [2024-10-11 16:39:46,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653006975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:46,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:39:46,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:39:46,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895531574] [2024-10-11 16:39:46,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:46,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:39:46,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:46,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:39:46,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:39:46,946 INFO L87 Difference]: Start difference. First operand has 396 states, 390 states have (on average 1.6282051282051282) internal successors, (635), 391 states have internal predecessors, (635), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:39:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:47,006 INFO L93 Difference]: Finished difference Result 790 states and 1279 transitions. [2024-10-11 16:39:47,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:39:47,008 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-10-11 16:39:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:47,015 INFO L225 Difference]: With dead ends: 790 [2024-10-11 16:39:47,015 INFO L226 Difference]: Without dead ends: 359 [2024-10-11 16:39:47,018 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:39:47,020 INFO L432 NwaCegarLoop]: 568 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, 568 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:39:47,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 568 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:39:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-11 16:39:47,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-11 16:39:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.4576271186440677) internal successors, (516), 354 states have internal predecessors, (516), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 522 transitions. [2024-10-11 16:39:47,061 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 522 transitions. Word has length 10 [2024-10-11 16:39:47,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:47,061 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 522 transitions. [2024-10-11 16:39:47,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:39:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2024-10-11 16:39:47,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 16:39:47,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:47,066 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:39:47,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:39:47,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:47,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:47,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1496970619, now seen corresponding path program 1 times [2024-10-11 16:39:47,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:47,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454112958] [2024-10-11 16:39:47,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:47,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:47,335 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:39:47,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:47,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454112958] [2024-10-11 16:39:47,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454112958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:47,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:39:47,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:39:47,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174783085] [2024-10-11 16:39:47,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:47,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:39:47,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:47,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:39:47,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:39:47,339 INFO L87 Difference]: Start difference. First operand 359 states and 522 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:39:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:47,432 INFO L93 Difference]: Finished difference Result 520 states and 758 transitions. [2024-10-11 16:39:47,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:39:47,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2024-10-11 16:39:47,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:47,435 INFO L225 Difference]: With dead ends: 520 [2024-10-11 16:39:47,435 INFO L226 Difference]: Without dead ends: 362 [2024-10-11 16:39:47,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:39:47,439 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 105 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:47,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1382 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:39:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-11 16:39:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 359. [2024-10-11 16:39:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.4378531073446328) internal successors, (509), 354 states have internal predecessors, (509), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 515 transitions. [2024-10-11 16:39:47,456 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 515 transitions. Word has length 65 [2024-10-11 16:39:47,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:47,457 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 515 transitions. [2024-10-11 16:39:47,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:39:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 515 transitions. [2024-10-11 16:39:47,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 16:39:47,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:47,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:39:47,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:39:47,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:47,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash 316506247, now seen corresponding path program 1 times [2024-10-11 16:39:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:47,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092907126] [2024-10-11 16:39:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:47,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:47,850 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:39:47,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:47,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092907126] [2024-10-11 16:39:47,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092907126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:47,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:39:47,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:39:47,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788686351] [2024-10-11 16:39:47,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:47,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:39:47,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:47,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:39:47,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:39:47,853 INFO L87 Difference]: Start difference. First operand 359 states and 515 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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:39:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:47,949 INFO L93 Difference]: Finished difference Result 873 states and 1253 transitions. [2024-10-11 16:39:47,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:39:47,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 65 [2024-10-11 16:39:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:47,952 INFO L225 Difference]: With dead ends: 873 [2024-10-11 16:39:47,952 INFO L226 Difference]: Without dead ends: 712 [2024-10-11 16:39:47,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:39:47,954 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 503 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:47,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1993 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:39:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-10-11 16:39:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 361. [2024-10-11 16:39:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 356 states have (on average 1.4353932584269662) internal successors, (511), 356 states have internal predecessors, (511), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 517 transitions. [2024-10-11 16:39:47,965 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 517 transitions. Word has length 65 [2024-10-11 16:39:47,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:47,965 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 517 transitions. [2024-10-11 16:39:47,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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:39:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 517 transitions. [2024-10-11 16:39:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 16:39:47,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:47,969 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:39:47,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:39:47,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:47,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash -640932924, now seen corresponding path program 1 times [2024-10-11 16:39:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:47,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230215378] [2024-10-11 16:39:47,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:47,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:48,207 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:39:48,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:48,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230215378] [2024-10-11 16:39:48,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230215378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:48,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:39:48,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:39:48,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079891302] [2024-10-11 16:39:48,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:48,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:39:48,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:48,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:39:48,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:39:48,209 INFO L87 Difference]: Start difference. First operand 361 states and 517 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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:39:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:48,296 INFO L93 Difference]: Finished difference Result 676 states and 964 transitions. [2024-10-11 16:39:48,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:39:48,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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 141 [2024-10-11 16:39:48,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:48,299 INFO L225 Difference]: With dead ends: 676 [2024-10-11 16:39:48,299 INFO L226 Difference]: Without dead ends: 319 [2024-10-11 16:39:48,301 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:39:48,301 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 30 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1213 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:39:48,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1213 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:39:48,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-11 16:39:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-10-11 16:39:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 314 states have (on average 1.3821656050955413) internal successors, (434), 314 states have internal predecessors, (434), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 440 transitions. [2024-10-11 16:39:48,315 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 440 transitions. Word has length 141 [2024-10-11 16:39:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:48,316 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 440 transitions. [2024-10-11 16:39:48,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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:39:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 440 transitions. [2024-10-11 16:39:48,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 16:39:48,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:48,318 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:39:48,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:39:48,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:48,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:48,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1670755272, now seen corresponding path program 1 times [2024-10-11 16:39:48,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:48,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096279478] [2024-10-11 16:39:48,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:48,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:48,495 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:39:48,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:48,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096279478] [2024-10-11 16:39:48,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096279478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:48,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:39:48,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:39:48,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160593282] [2024-10-11 16:39:48,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:48,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:39:48,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:48,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:39:48,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:39:48,501 INFO L87 Difference]: Start difference. First operand 319 states and 440 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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:39:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:48,559 INFO L93 Difference]: Finished difference Result 858 states and 1192 transitions. [2024-10-11 16:39:48,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:39:48,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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 141 [2024-10-11 16:39:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:48,562 INFO L225 Difference]: With dead ends: 858 [2024-10-11 16:39:48,563 INFO L226 Difference]: Without dead ends: 543 [2024-10-11 16:39:48,564 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:39:48,565 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 253 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1030 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:39:48,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1030 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:39:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-10-11 16:39:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 541. [2024-10-11 16:39:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 536 states have (on average 1.3936567164179106) internal successors, (747), 536 states have internal predecessors, (747), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 753 transitions. [2024-10-11 16:39:48,581 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 753 transitions. Word has length 141 [2024-10-11 16:39:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:48,582 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 753 transitions. [2024-10-11 16:39:48,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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:39:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 753 transitions. [2024-10-11 16:39:48,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 16:39:48,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:48,586 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] [2024-10-11 16:39:48,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:39:48,587 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:48,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:48,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1920510785, now seen corresponding path program 1 times [2024-10-11 16:39:48,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:48,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277477532] [2024-10-11 16:39:48,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:48,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:48,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:39:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:48,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:39:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:48,778 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:39:48,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:48,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277477532] [2024-10-11 16:39:48,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277477532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:48,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:39:48,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:39:48,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635963463] [2024-10-11 16:39:48,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:48,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:39:48,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:48,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:39:48,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:39:48,783 INFO L87 Difference]: Start difference. First operand 541 states and 753 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:39:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:48,946 INFO L93 Difference]: Finished difference Result 1050 states and 1473 transitions. [2024-10-11 16:39:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:39:48,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2024-10-11 16:39:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:48,950 INFO L225 Difference]: With dead ends: 1050 [2024-10-11 16:39:48,950 INFO L226 Difference]: Without dead ends: 543 [2024-10-11 16:39:48,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:39:48,951 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 3 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:48,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1195 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:39:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-10-11 16:39:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 541. [2024-10-11 16:39:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 536 states have (on average 1.382462686567164) internal successors, (741), 536 states have internal predecessors, (741), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 747 transitions. [2024-10-11 16:39:48,966 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 747 transitions. Word has length 154 [2024-10-11 16:39:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:48,966 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 747 transitions. [2024-10-11 16:39:48,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:39:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 747 transitions. [2024-10-11 16:39:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 16:39:48,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:48,968 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] [2024-10-11 16:39:48,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:39:48,968 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:48,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1058677183, now seen corresponding path program 1 times [2024-10-11 16:39:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:48,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387544941] [2024-10-11 16:39:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:48,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:49,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:39:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:49,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:39:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:49,260 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:39:49,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:49,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387544941] [2024-10-11 16:39:49,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387544941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:49,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:39:49,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:39:49,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426053231] [2024-10-11 16:39:49,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:49,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:39:49,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:49,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:39:49,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:39:49,263 INFO L87 Difference]: Start difference. First operand 541 states and 747 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:39:49,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:49,568 INFO L93 Difference]: Finished difference Result 1072 states and 1487 transitions. [2024-10-11 16:39:49,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:39:49,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2024-10-11 16:39:49,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:49,571 INFO L225 Difference]: With dead ends: 1072 [2024-10-11 16:39:49,571 INFO L226 Difference]: Without dead ends: 622 [2024-10-11 16:39:49,572 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:39:49,573 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 1425 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:49,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 1533 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:39:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-10-11 16:39:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 406. [2024-10-11 16:39:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 401 states have (on average 1.3566084788029926) internal successors, (544), 401 states have internal predecessors, (544), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 550 transitions. [2024-10-11 16:39:49,585 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 550 transitions. Word has length 154 [2024-10-11 16:39:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:49,586 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 550 transitions. [2024-10-11 16:39:49,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:39:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 550 transitions. [2024-10-11 16:39:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 16:39:49,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:49,588 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, 1, 1] [2024-10-11 16:39:49,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:39:49,588 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:49,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:49,589 INFO L85 PathProgramCache]: Analyzing trace with hash -942364693, now seen corresponding path program 1 times [2024-10-11 16:39:49,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:49,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286813061] [2024-10-11 16:39:49,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:49,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:49,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:39:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:50,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:39:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:39:50,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:50,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286813061] [2024-10-11 16:39:50,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286813061] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:39:50,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724246569] [2024-10-11 16:39:50,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:50,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:39:50,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:39:50,016 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:39:50,017 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:39:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:50,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 16:39:50,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:39:50,376 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:39:50,397 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 16 treesize of output 17 [2024-10-11 16:39:50,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 16:39:50,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 58 [2024-10-11 16:39:51,061 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:39:51,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:39:51,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724246569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:51,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:39:51,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-10-11 16:39:51,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992864197] [2024-10-11 16:39:51,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:51,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:39:51,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:51,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:39:51,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:39:51,068 INFO L87 Difference]: Start difference. First operand 406 states and 550 transitions. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 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:39:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:52,048 INFO L93 Difference]: Finished difference Result 981 states and 1350 transitions. [2024-10-11 16:39:52,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:39:52,049 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 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 164 [2024-10-11 16:39:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:52,052 INFO L225 Difference]: With dead ends: 981 [2024-10-11 16:39:52,052 INFO L226 Difference]: Without dead ends: 619 [2024-10-11 16:39:52,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-10-11 16:39:52,056 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 536 mSDsluCounter, 2092 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:52,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 2498 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:39:52,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-10-11 16:39:52,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 406. [2024-10-11 16:39:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 401 states have (on average 1.3541147132169575) internal successors, (543), 401 states have internal predecessors, (543), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 549 transitions. [2024-10-11 16:39:52,070 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 549 transitions. Word has length 164 [2024-10-11 16:39:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:52,070 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 549 transitions. [2024-10-11 16:39:52,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 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:39:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 549 transitions. [2024-10-11 16:39:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 16:39:52,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:52,072 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, 1, 1, 1] [2024-10-11 16:39:52,089 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:39:52,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:39:52,273 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:52,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:52,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1959166924, now seen corresponding path program 1 times [2024-10-11 16:39:52,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:52,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501709378] [2024-10-11 16:39:52,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:52,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:52,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 16:39:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:52,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 16:39:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:39:52,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:52,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501709378] [2024-10-11 16:39:52,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501709378] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:39:52,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578455340] [2024-10-11 16:39:52,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:52,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:39:52,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:39:52,586 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:39:52,587 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:39:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:52,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 16:39:52,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:39:52,901 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:39:53,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 16:39:53,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2024-10-11 16:39:53,388 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:39:53,389 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:39:53,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578455340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:53,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:39:53,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2024-10-11 16:39:53,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752734927] [2024-10-11 16:39:53,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:53,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:39:53,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:53,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:39:53,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:39:53,390 INFO L87 Difference]: Start difference. First operand 406 states and 549 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:39:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:54,308 INFO L93 Difference]: Finished difference Result 824 states and 1133 transitions. [2024-10-11 16:39:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:39:54,309 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 165 [2024-10-11 16:39:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:54,311 INFO L225 Difference]: With dead ends: 824 [2024-10-11 16:39:54,311 INFO L226 Difference]: Without dead ends: 666 [2024-10-11 16:39:54,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-10-11 16:39:54,312 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 473 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:54,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 2009 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:39:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-11 16:39:54,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 437. [2024-10-11 16:39:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 432 states have (on average 1.3402777777777777) internal successors, (579), 432 states have internal predecessors, (579), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 585 transitions. [2024-10-11 16:39:54,326 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 585 transitions. Word has length 165 [2024-10-11 16:39:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:54,326 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 585 transitions. [2024-10-11 16:39:54,327 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:39:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 585 transitions. [2024-10-11 16:39:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 16:39:54,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:54,328 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, 1, 1, 1, 1] [2024-10-11 16:39:54,345 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:39:54,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:39:54,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:54,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:54,529 INFO L85 PathProgramCache]: Analyzing trace with hash 649017456, now seen corresponding path program 1 times [2024-10-11 16:39:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:54,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18270754] [2024-10-11 16:39:54,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:54,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:54,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 16:39:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:54,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 16:39:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:39:54,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:54,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18270754] [2024-10-11 16:39:54,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18270754] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:39:54,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074944387] [2024-10-11 16:39:54,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:54,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:39:54,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:39:54,968 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:39:54,969 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:39:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:55,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 16:39:55,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:39:55,472 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:39:55,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:39:55,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074944387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:55,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:39:55,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-11 16:39:55,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033896204] [2024-10-11 16:39:55,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:55,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:39:55,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:55,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:39:55,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:39:55,475 INFO L87 Difference]: Start difference. First operand 437 states and 585 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:39:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:55,564 INFO L93 Difference]: Finished difference Result 830 states and 1123 transitions. [2024-10-11 16:39:55,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:39:55,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 166 [2024-10-11 16:39:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:55,566 INFO L225 Difference]: With dead ends: 830 [2024-10-11 16:39:55,566 INFO L226 Difference]: Without dead ends: 437 [2024-10-11 16:39:55,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:39:55,567 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 17 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:55,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1127 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:39:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-11 16:39:55,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2024-10-11 16:39:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 432 states have (on average 1.3356481481481481) internal successors, (577), 432 states have internal predecessors, (577), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 583 transitions. [2024-10-11 16:39:55,579 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 583 transitions. Word has length 166 [2024-10-11 16:39:55,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:55,579 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 583 transitions. [2024-10-11 16:39:55,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:39:55,579 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 583 transitions. [2024-10-11 16:39:55,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 16:39:55,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:55,580 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, 1, 1, 1, 1, 1] [2024-10-11 16:39:55,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 16:39:55,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:39:55,781 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:55,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:55,782 INFO L85 PathProgramCache]: Analyzing trace with hash 224944854, now seen corresponding path program 1 times [2024-10-11 16:39:55,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:55,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859295200] [2024-10-11 16:39:55,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:55,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:56,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:39:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:56,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:39:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:56,068 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:39:56,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:56,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859295200] [2024-10-11 16:39:56,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859295200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:56,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:39:56,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:39:56,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819859650] [2024-10-11 16:39:56,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:56,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:39:56,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:56,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:39:56,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:39:56,070 INFO L87 Difference]: Start difference. First operand 437 states and 583 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 6 states have internal predecessors, (161), 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:39:56,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:56,350 INFO L93 Difference]: Finished difference Result 835 states and 1130 transitions. [2024-10-11 16:39:56,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:39:56,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 6 states have internal predecessors, (161), 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 167 [2024-10-11 16:39:56,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:56,352 INFO L225 Difference]: With dead ends: 835 [2024-10-11 16:39:56,352 INFO L226 Difference]: Without dead ends: 445 [2024-10-11 16:39:56,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:39:56,353 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 10 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:56,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1829 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:39:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-11 16:39:56,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 443. [2024-10-11 16:39:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 438 states have (on average 1.3310502283105023) internal successors, (583), 438 states have internal predecessors, (583), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 589 transitions. [2024-10-11 16:39:56,365 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 589 transitions. Word has length 167 [2024-10-11 16:39:56,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:56,365 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 589 transitions. [2024-10-11 16:39:56,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 6 states have internal predecessors, (161), 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:39:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 589 transitions. [2024-10-11 16:39:56,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:39:56,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:56,367 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, 1, 1, 1, 1, 1, 1] [2024-10-11 16:39:56,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 16:39:56,367 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:56,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:56,368 INFO L85 PathProgramCache]: Analyzing trace with hash -222150697, now seen corresponding path program 1 times [2024-10-11 16:39:56,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:56,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265921777] [2024-10-11 16:39:56,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:56,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:56,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:39:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:56,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:39:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:56,621 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:39:56,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:56,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265921777] [2024-10-11 16:39:56,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265921777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:56,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:39:56,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:39:56,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357484360] [2024-10-11 16:39:56,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:56,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:39:56,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:56,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:39:56,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:39:56,623 INFO L87 Difference]: Start difference. First operand 443 states and 589 transitions. Second operand has 8 states, 8 states have (on average 20.25) internal successors, (162), 7 states have internal predecessors, (162), 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:39:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:56,995 INFO L93 Difference]: Finished difference Result 841 states and 1134 transitions. [2024-10-11 16:39:56,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:39:56,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 7 states have internal predecessors, (162), 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 168 [2024-10-11 16:39:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:56,997 INFO L225 Difference]: With dead ends: 841 [2024-10-11 16:39:56,997 INFO L226 Difference]: Without dead ends: 455 [2024-10-11 16:39:56,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:39:56,998 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 14 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:56,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2474 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:39:56,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-10-11 16:39:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 451. [2024-10-11 16:39:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 446 states have (on average 1.3295964125560538) internal successors, (593), 446 states have internal predecessors, (593), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 599 transitions. [2024-10-11 16:39:57,010 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 599 transitions. Word has length 168 [2024-10-11 16:39:57,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:57,010 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 599 transitions. [2024-10-11 16:39:57,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 7 states have internal predecessors, (162), 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:39:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 599 transitions. [2024-10-11 16:39:57,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:39:57,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:57,012 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, 1, 1, 1, 1, 1, 1] [2024-10-11 16:39:57,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 16:39:57,012 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:57,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:57,013 INFO L85 PathProgramCache]: Analyzing trace with hash -853712781, now seen corresponding path program 1 times [2024-10-11 16:39:57,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:57,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913528272] [2024-10-11 16:39:57,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:57,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:57,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:39:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:57,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:39:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:39:57,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:57,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913528272] [2024-10-11 16:39:57,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913528272] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:39:57,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714012178] [2024-10-11 16:39:57,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:57,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:39:57,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:39:57,277 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:39:57,278 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:39:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:57,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 16:39:57,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:39:57,699 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:39:57,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:39:57,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714012178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:57,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:39:57,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-10-11 16:39:57,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83676226] [2024-10-11 16:39:57,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:57,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:39:57,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:57,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:39:57,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:39:57,703 INFO L87 Difference]: Start difference. First operand 451 states and 599 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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:39:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:57,956 INFO L93 Difference]: Finished difference Result 644 states and 870 transitions. [2024-10-11 16:39:57,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:39:57,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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 168 [2024-10-11 16:39:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:57,958 INFO L225 Difference]: With dead ends: 644 [2024-10-11 16:39:57,958 INFO L226 Difference]: Without dead ends: 486 [2024-10-11 16:39:57,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:39:57,959 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 34 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:57,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1730 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 16:39:57,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-10-11 16:39:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 478. [2024-10-11 16:39:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 473 states have (on average 1.3234672304439747) internal successors, (626), 473 states have internal predecessors, (626), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 632 transitions. [2024-10-11 16:39:57,971 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 632 transitions. Word has length 168 [2024-10-11 16:39:57,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:57,972 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 632 transitions. [2024-10-11 16:39:57,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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:39:57,972 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 632 transitions. [2024-10-11 16:39:57,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 16:39:57,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:57,973 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:39:57,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 16:39:58,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 16:39:58,174 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:58,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:58,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1932942076, now seen corresponding path program 1 times [2024-10-11 16:39:58,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:58,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713956389] [2024-10-11 16:39:58,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:58,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:58,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:39:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:58,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:39:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:58,427 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:39:58,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:58,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713956389] [2024-10-11 16:39:58,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713956389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:58,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:39:58,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:39:58,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169987527] [2024-10-11 16:39:58,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:58,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:39:58,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:58,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:39:58,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:39:58,429 INFO L87 Difference]: Start difference. First operand 478 states and 632 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 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:39:58,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:58,944 INFO L93 Difference]: Finished difference Result 671 states and 904 transitions. [2024-10-11 16:39:58,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:39:58,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 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 169 [2024-10-11 16:39:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:58,947 INFO L225 Difference]: With dead ends: 671 [2024-10-11 16:39:58,947 INFO L226 Difference]: Without dead ends: 486 [2024-10-11 16:39:58,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:39:58,948 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 10 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:58,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1904 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:39:58,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-10-11 16:39:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 482. [2024-10-11 16:39:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 477 states have (on average 1.3228511530398324) internal successors, (631), 477 states have internal predecessors, (631), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 637 transitions. [2024-10-11 16:39:58,965 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 637 transitions. Word has length 169 [2024-10-11 16:39:58,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:58,965 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 637 transitions. [2024-10-11 16:39:58,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 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:39:58,965 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 637 transitions. [2024-10-11 16:39:58,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 16:39:58,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:58,967 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:39:58,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 16:39:58,967 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:58,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:58,968 INFO L85 PathProgramCache]: Analyzing trace with hash 815608908, now seen corresponding path program 1 times [2024-10-11 16:39:58,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:58,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625796979] [2024-10-11 16:39:58,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:58,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:59,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:39:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:59,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:39:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:59,241 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:39:59,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:59,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625796979] [2024-10-11 16:39:59,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625796979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:59,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:39:59,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:39:59,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615438477] [2024-10-11 16:39:59,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:59,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:39:59,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:59,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:39:59,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:39:59,244 INFO L87 Difference]: Start difference. First operand 482 states and 637 transitions. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 7 states have internal predecessors, (163), 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:40:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:40:00,422 INFO L93 Difference]: Finished difference Result 684 states and 922 transitions. [2024-10-11 16:40:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:40:00,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 7 states have internal predecessors, (163), 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 170 [2024-10-11 16:40:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:40:00,424 INFO L225 Difference]: With dead ends: 684 [2024-10-11 16:40:00,424 INFO L226 Difference]: Without dead ends: 495 [2024-10-11 16:40:00,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:40:00,425 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 14 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:40:00,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2172 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 16:40:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-10-11 16:40:00,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 490. [2024-10-11 16:40:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 485 states have (on average 1.3237113402061855) internal successors, (642), 485 states have internal predecessors, (642), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:40:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 648 transitions. [2024-10-11 16:40:00,437 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 648 transitions. Word has length 170 [2024-10-11 16:40:00,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:40:00,437 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 648 transitions. [2024-10-11 16:40:00,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 7 states have internal predecessors, (163), 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:40:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 648 transitions. [2024-10-11 16:40:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 16:40:00,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:40:00,439 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:40:00,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 16:40:00,439 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:40:00,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:40:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash -939539152, now seen corresponding path program 1 times [2024-10-11 16:40:00,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:40:00,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275815633] [2024-10-11 16:40:00,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:40:00,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:40:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:00,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:40:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:00,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:40:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:40:00,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:40:00,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275815633] [2024-10-11 16:40:00,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275815633] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:40:00,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188290450] [2024-10-11 16:40:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:40:00,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:40:00,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:40:00,726 INFO L229 MonitoredProcess]: Starting monitored process 6 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:40:00,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 16:40:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:01,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 16:40:01,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:40:01,308 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:40:01,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:40:01,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188290450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:40:01,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:40:01,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-10-11 16:40:01,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433664931] [2024-10-11 16:40:01,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:40:01,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:40:01,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:40:01,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:40:01,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:40:01,310 INFO L87 Difference]: Start difference. First operand 490 states and 648 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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:40:01,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:40:01,743 INFO L93 Difference]: Finished difference Result 694 states and 933 transitions. [2024-10-11 16:40:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:40:01,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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 170 [2024-10-11 16:40:01,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:40:01,746 INFO L225 Difference]: With dead ends: 694 [2024-10-11 16:40:01,746 INFO L226 Difference]: Without dead ends: 497 [2024-10-11 16:40:01,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:40:01,746 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 12 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:40:01,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1832 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:40:01,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-11 16:40:01,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 490. [2024-10-11 16:40:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 485 states have (on average 1.3237113402061855) internal successors, (642), 485 states have internal predecessors, (642), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:40:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 648 transitions. [2024-10-11 16:40:01,758 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 648 transitions. Word has length 170 [2024-10-11 16:40:01,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:40:01,759 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 648 transitions. [2024-10-11 16:40:01,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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:40:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 648 transitions. [2024-10-11 16:40:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 16:40:01,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:40:01,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:40:01,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 16:40:01,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 16:40:01,961 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:40:01,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:40:01,962 INFO L85 PathProgramCache]: Analyzing trace with hash -369690344, now seen corresponding path program 1 times [2024-10-11 16:40:01,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:40:01,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341559726] [2024-10-11 16:40:01,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:40:01,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:40:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:02,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:40:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:02,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:40:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:02,259 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:40:02,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:40:02,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341559726] [2024-10-11 16:40:02,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341559726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:40:02,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:40:02,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:40:02,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280395356] [2024-10-11 16:40:02,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:40:02,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:40:02,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:40:02,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:40:02,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:40:02,261 INFO L87 Difference]: Start difference. First operand 490 states and 648 transitions. Second operand has 10 states, 10 states have (on average 16.4) internal successors, (164), 9 states have internal predecessors, (164), 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:40:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:40:02,697 INFO L93 Difference]: Finished difference Result 702 states and 945 transitions. [2024-10-11 16:40:02,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:40:02,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 9 states have internal predecessors, (164), 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 171 [2024-10-11 16:40:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:40:02,699 INFO L225 Difference]: With dead ends: 702 [2024-10-11 16:40:02,699 INFO L226 Difference]: Without dead ends: 505 [2024-10-11 16:40:02,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:40:02,700 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 22 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:40:02,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2326 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:40:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-10-11 16:40:02,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 497. [2024-10-11 16:40:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 492 states have (on average 1.3231707317073171) internal successors, (651), 492 states have internal predecessors, (651), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:40:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 657 transitions. [2024-10-11 16:40:02,714 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 657 transitions. Word has length 171 [2024-10-11 16:40:02,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:40:02,714 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 657 transitions. [2024-10-11 16:40:02,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 9 states have internal predecessors, (164), 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:40:02,714 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 657 transitions. [2024-10-11 16:40:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 16:40:02,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:40:02,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:40:02,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 16:40:02,716 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:40:02,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:40:02,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1055294644, now seen corresponding path program 1 times [2024-10-11 16:40:02,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:40:02,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67534080] [2024-10-11 16:40:02,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:40:02,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:40:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:02,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:40:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:03,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:40:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:40:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:40:03,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67534080] [2024-10-11 16:40:03,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67534080] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:40:03,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314224460] [2024-10-11 16:40:03,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:40:03,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:40:03,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:40:03,013 INFO L229 MonitoredProcess]: Starting monitored process 7 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:40:03,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 16:40:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:03,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 16:40:03,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:40:03,438 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:40:03,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:40:03,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314224460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:40:03,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:40:03,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-10-11 16:40:03,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549161353] [2024-10-11 16:40:03,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:40:03,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:40:03,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:40:03,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:40:03,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:40:03,442 INFO L87 Difference]: Start difference. First operand 497 states and 657 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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:40:03,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:40:03,792 INFO L93 Difference]: Finished difference Result 713 states and 959 transitions. [2024-10-11 16:40:03,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:40:03,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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 171 [2024-10-11 16:40:03,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:40:03,797 INFO L225 Difference]: With dead ends: 713 [2024-10-11 16:40:03,797 INFO L226 Difference]: Without dead ends: 509 [2024-10-11 16:40:03,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:40:03,798 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 17 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:40:03,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1862 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:40:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-11 16:40:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 504. [2024-10-11 16:40:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 499 states have (on average 1.3246492985971945) internal successors, (661), 499 states have internal predecessors, (661), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:40:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 667 transitions. [2024-10-11 16:40:03,816 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 667 transitions. Word has length 171 [2024-10-11 16:40:03,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:40:03,816 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 667 transitions. [2024-10-11 16:40:03,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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:40:03,816 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 667 transitions. [2024-10-11 16:40:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 16:40:03,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:40:03,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:40:03,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 16:40:04,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 16:40:04,022 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:40:04,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:40:04,024 INFO L85 PathProgramCache]: Analyzing trace with hash -220664352, now seen corresponding path program 1 times [2024-10-11 16:40:04,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:40:04,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2927697] [2024-10-11 16:40:04,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:40:04,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:40:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:04,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:40:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:04,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:40:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:04,363 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:40:04,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:40:04,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2927697] [2024-10-11 16:40:04,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2927697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:40:04,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:40:04,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 16:40:04,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902327416] [2024-10-11 16:40:04,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:40:04,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:40:04,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:40:04,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:40:04,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:40:04,366 INFO L87 Difference]: Start difference. First operand 504 states and 667 transitions. Second operand has 11 states, 11 states have (on average 15.0) internal successors, (165), 10 states have internal predecessors, (165), 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:40:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:40:05,007 INFO L93 Difference]: Finished difference Result 726 states and 979 transitions. [2024-10-11 16:40:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:40:05,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 10 states have internal predecessors, (165), 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 172 [2024-10-11 16:40:05,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:40:05,010 INFO L225 Difference]: With dead ends: 726 [2024-10-11 16:40:05,010 INFO L226 Difference]: Without dead ends: 515 [2024-10-11 16:40:05,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:40:05,011 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 25 mSDsluCounter, 2684 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3097 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:40:05,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3097 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:40:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-11 16:40:05,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 507. [2024-10-11 16:40:05,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 502 states have (on average 1.3227091633466135) internal successors, (664), 502 states have internal predecessors, (664), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:40:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 670 transitions. [2024-10-11 16:40:05,024 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 670 transitions. Word has length 172 [2024-10-11 16:40:05,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:40:05,024 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 670 transitions. [2024-10-11 16:40:05,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 10 states have internal predecessors, (165), 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:40:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 670 transitions. [2024-10-11 16:40:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 16:40:05,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:40:05,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:40:05,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 16:40:05,026 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:40:05,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:40:05,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1004197316, now seen corresponding path program 1 times [2024-10-11 16:40:05,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:40:05,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025305188] [2024-10-11 16:40:05,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:40:05,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:40:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:05,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:40:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:05,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:40:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:40:05,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:40:05,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025305188] [2024-10-11 16:40:05,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025305188] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:40:05,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546149100] [2024-10-11 16:40:05,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:40:05,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:40:05,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:40:05,258 INFO L229 MonitoredProcess]: Starting monitored process 8 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:40:05,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 16:40:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:05,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 16:40:05,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:40:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:40:05,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:40:05,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546149100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:40:05,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:40:05,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-11 16:40:05,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615115421] [2024-10-11 16:40:05,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:40:05,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:40:05,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:40:05,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:40:05,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:40:05,805 INFO L87 Difference]: Start difference. First operand 507 states and 670 transitions. Second operand has 4 states, 3 states have (on average 56.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 16:40:05,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:40:05,833 INFO L93 Difference]: Finished difference Result 915 states and 1216 transitions. [2024-10-11 16:40:05,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:40:05,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 56.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 172 [2024-10-11 16:40:05,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:40:05,835 INFO L225 Difference]: With dead ends: 915 [2024-10-11 16:40:05,835 INFO L226 Difference]: Without dead ends: 509 [2024-10-11 16:40:05,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:40:05,836 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 0 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:40:05,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1271 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:40:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-11 16:40:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2024-10-11 16:40:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 503 states have (on average 1.3240556660039762) internal successors, (666), 504 states have internal predecessors, (666), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 16:40:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 673 transitions. [2024-10-11 16:40:05,848 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 673 transitions. Word has length 172 [2024-10-11 16:40:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:40:05,849 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 673 transitions. [2024-10-11 16:40:05,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 56.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 16:40:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 673 transitions. [2024-10-11 16:40:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-11 16:40:05,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:40:05,850 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:40:05,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 16:40:06,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:40:06,051 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:40:06,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:40:06,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1448136208, now seen corresponding path program 1 times [2024-10-11 16:40:06,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:40:06,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902882139] [2024-10-11 16:40:06,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:40:06,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:40:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:06,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:40:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:06,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 16:40:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 16:40:06,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:40:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902882139] [2024-10-11 16:40:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902882139] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:40:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214189831] [2024-10-11 16:40:06,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:40:06,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:40:06,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:40:06,413 INFO L229 MonitoredProcess]: Starting monitored process 9 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:40:06,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 16:40:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:40:06,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-10-11 16:40:06,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:40:06,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 16:40:07,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:40:07,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:40:07,191 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-10-11 16:40:07,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-10-11 16:40:07,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-11 16:40:07,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 16:40:07,343 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 16:40:07,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-11 16:40:07,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11