./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_SAX_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_SAX_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 d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:37:22,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:37:22,097 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:37:22,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:37:22,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:37:22,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:37:22,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:37:22,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:37:22,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:37:22,134 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:37:22,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:37:22,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:37:22,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:37:22,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:37:22,136 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:37:22,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:37:22,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:37:22,137 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:37:22,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:37:22,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:37:22,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:37:22,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:37:22,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:37:22,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:37:22,140 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:37:22,140 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:37:22,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:37:22,141 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:37:22,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:37:22,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:37:22,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:37:22,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:37:22,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:37:22,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:37:22,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:37:22,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:37:22,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:37:22,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:37:22,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:37:22,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:37:22,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:37:22,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:37:22,146 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 -> d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d [2024-10-11 16:37:22,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:37:22,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:37:22,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:37:22,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:37:22,439 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:37:22,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2024-10-11 16:37:23,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:37:24,150 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:37:24,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2024-10-11 16:37:24,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ec36547b8/29ca1a34f4dd4c248d93dd94af7c3a9f/FLAG46220bed9 [2024-10-11 16:37:24,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ec36547b8/29ca1a34f4dd4c248d93dd94af7c3a9f [2024-10-11 16:37:24,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:37:24,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:37:24,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:37:24,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:37:24,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:37:24,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:37:24" (1/1) ... [2024-10-11 16:37:24,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@690e545a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:37:24, skipping insertion in model container [2024-10-11 16:37:24,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:37:24" (1/1) ... [2024-10-11 16:37:24,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:37:24,696 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_SAX_test2-2.i[37019,37032] [2024-10-11 16:37:24,824 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_SAX_test2-2.i[47352,47365] [2024-10-11 16:37:24,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:37:24,869 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:37:24,918 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_SAX_test2-2.i[37019,37032] [2024-10-11 16:37:24,984 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_SAX_test2-2.i[47352,47365] [2024-10-11 16:37:24,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:37:25,044 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:37:25,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:37:25 WrapperNode [2024-10-11 16:37:25,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:37:25,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:37:25,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:37:25,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:37:25,054 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:37:25" (1/1) ... [2024-10-11 16:37:25,087 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:37:25" (1/1) ... [2024-10-11 16:37:25,171 INFO L138 Inliner]: procedures = 208, calls = 278, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1468 [2024-10-11 16:37:25,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:37:25,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:37:25,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:37:25,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:37:25,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:37:25" (1/1) ... [2024-10-11 16:37:25,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:37:25" (1/1) ... [2024-10-11 16:37:25,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:37:25" (1/1) ... [2024-10-11 16:37:25,297 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-10-11 16:37:25,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:37:25" (1/1) ... [2024-10-11 16:37:25,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:37:25" (1/1) ... [2024-10-11 16:37:25,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:37:25" (1/1) ... [2024-10-11 16:37:25,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:37:25" (1/1) ... [2024-10-11 16:37:25,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:37:25" (1/1) ... [2024-10-11 16:37:25,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:37:25" (1/1) ... [2024-10-11 16:37:25,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:37:25,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:37:25,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:37:25,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:37:25,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:37:25" (1/1) ... [2024-10-11 16:37:25,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:37:25,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:37:25,476 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:37:25,479 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:37:25,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:37:25,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:37:25,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:37:25,537 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:37:25,538 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:37:25,538 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:37:25,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:37:25,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:37:25,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:37:25,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:37:25,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:37:25,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:37:25,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:37:25,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:37:25,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 16:37:25,539 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 16:37:25,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:37:25,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:37:25,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:37:25,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:37:25,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:37:25,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:37:25,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:37:25,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:37:25,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:37:25,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:37:25,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:37:25,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:37:25,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:37:25,779 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:37:25,781 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:37:27,195 INFO L? ?]: Removed 329 outVars from TransFormulas that were not future-live. [2024-10-11 16:37:27,196 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:37:27,243 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:37:27,244 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-11 16:37:27,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:37:27 BoogieIcfgContainer [2024-10-11 16:37:27,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:37:27,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:37:27,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:37:27,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:37:27,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:37:24" (1/3) ... [2024-10-11 16:37:27,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d2c404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:37:27, skipping insertion in model container [2024-10-11 16:37:27,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:37:25" (2/3) ... [2024-10-11 16:37:27,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d2c404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:37:27, skipping insertion in model container [2024-10-11 16:37:27,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:37:27" (3/3) ... [2024-10-11 16:37:27,253 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-2.i [2024-10-11 16:37:27,270 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:37:27,271 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 16:37:27,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:37:27,362 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;@32896707, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:37:27,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 16:37:27,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 410 states, 397 states have (on average 1.6322418136020151) internal successors, (648), 404 states have internal predecessors, (648), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 16:37:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 16:37:27,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:27,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:37:27,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:27,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:27,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1542023367, now seen corresponding path program 1 times [2024-10-11 16:37:27,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:27,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868859117] [2024-10-11 16:37:27,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:27,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:37:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:27,556 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:37:27,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:37:27,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868859117] [2024-10-11 16:37:27,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868859117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:37:27,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:37:27,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:37:27,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478549273] [2024-10-11 16:37:27,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:37:27,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:37:27,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:37:27,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:37:27,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:37:27,592 INFO L87 Difference]: Start difference. First operand has 410 states, 397 states have (on average 1.6322418136020151) internal successors, (648), 404 states have internal predecessors, (648), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:37:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:37:27,716 INFO L93 Difference]: Finished difference Result 819 states and 1332 transitions. [2024-10-11 16:37:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:37:27,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 16:37:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:37:27,735 INFO L225 Difference]: With dead ends: 819 [2024-10-11 16:37:27,736 INFO L226 Difference]: Without dead ends: 374 [2024-10-11 16:37:27,744 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:37:27,747 INFO L432 NwaCegarLoop]: 590 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, 590 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:37:27,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 590 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:37:27,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-11 16:37:27,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-10-11 16:37:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 362 states have (on average 1.4640883977900552) internal successors, (530), 368 states have internal predecessors, (530), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 16:37:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 546 transitions. [2024-10-11 16:37:27,820 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 546 transitions. Word has length 8 [2024-10-11 16:37:27,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:37:27,821 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 546 transitions. [2024-10-11 16:37:27,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:37:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 546 transitions. [2024-10-11 16:37:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 16:37:27,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:27,827 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:37:27,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:37:27,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:27,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:27,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1122325729, now seen corresponding path program 1 times [2024-10-11 16:37:27,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:27,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43485096] [2024-10-11 16:37:27,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:27,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:37:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:28,278 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:37:28,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:37:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43485096] [2024-10-11 16:37:28,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43485096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:37:28,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:37:28,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:37:28,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523291178] [2024-10-11 16:37:28,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:37:28,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:37:28,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:37:28,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:37:28,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:37:28,286 INFO L87 Difference]: Start difference. First operand 374 states and 546 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:37:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:37:28,462 INFO L93 Difference]: Finished difference Result 912 states and 1341 transitions. [2024-10-11 16:37:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:37:28,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-11 16:37:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:37:28,468 INFO L225 Difference]: With dead ends: 912 [2024-10-11 16:37:28,468 INFO L226 Difference]: Without dead ends: 737 [2024-10-11 16:37:28,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:37:28,471 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 517 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:37:28,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1653 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:37:28,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-11 16:37:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 376. [2024-10-11 16:37:28,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 364 states have (on average 1.4615384615384615) internal successors, (532), 370 states have internal predecessors, (532), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 16:37:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 548 transitions. [2024-10-11 16:37:28,507 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 548 transitions. Word has length 63 [2024-10-11 16:37:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:37:28,508 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 548 transitions. [2024-10-11 16:37:28,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:37:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 548 transitions. [2024-10-11 16:37:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 16:37:28,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:28,513 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:37:28,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:37:28,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:28,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:28,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1788977598, now seen corresponding path program 1 times [2024-10-11 16:37:28,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:28,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902217595] [2024-10-11 16:37:28,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:28,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:37:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:28,903 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:37:28,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:37:28,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902217595] [2024-10-11 16:37:28,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902217595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:37:28,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:37:28,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:37:28,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649655875] [2024-10-11 16:37:28,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:37:28,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:37:28,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:37:28,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:37:28,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:37:28,906 INFO L87 Difference]: Start difference. First operand 376 states and 548 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:37:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:37:29,009 INFO L93 Difference]: Finished difference Result 707 states and 1027 transitions. [2024-10-11 16:37:29,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:37:29,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2024-10-11 16:37:29,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:37:29,013 INFO L225 Difference]: With dead ends: 707 [2024-10-11 16:37:29,015 INFO L226 Difference]: Without dead ends: 334 [2024-10-11 16:37:29,016 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:37:29,017 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 30 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1306 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:37:29,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1306 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:37:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-11 16:37:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2024-10-11 16:37:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 322 states have (on average 1.4130434782608696) internal successors, (455), 328 states have internal predecessors, (455), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 16:37:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 471 transitions. [2024-10-11 16:37:29,034 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 471 transitions. Word has length 139 [2024-10-11 16:37:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:37:29,035 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 471 transitions. [2024-10-11 16:37:29,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:37:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 471 transitions. [2024-10-11 16:37:29,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 16:37:29,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:29,040 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:37:29,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:37:29,040 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:29,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:29,041 INFO L85 PathProgramCache]: Analyzing trace with hash 484543950, now seen corresponding path program 1 times [2024-10-11 16:37:29,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:29,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191276369] [2024-10-11 16:37:29,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:29,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:37:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:29,287 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:37:29,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:37:29,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191276369] [2024-10-11 16:37:29,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191276369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:37:29,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:37:29,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:37:29,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462575564] [2024-10-11 16:37:29,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:37:29,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:37:29,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:37:29,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:37:29,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:37:29,290 INFO L87 Difference]: Start difference. First operand 334 states and 471 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:37:29,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:37:29,368 INFO L93 Difference]: Finished difference Result 899 states and 1282 transitions. [2024-10-11 16:37:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:37:29,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2024-10-11 16:37:29,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:37:29,373 INFO L225 Difference]: With dead ends: 899 [2024-10-11 16:37:29,373 INFO L226 Difference]: Without dead ends: 568 [2024-10-11 16:37:29,376 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:37:29,377 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 270 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1103 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:37:29,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:37:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-10-11 16:37:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2024-10-11 16:37:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 549 states have (on average 1.429872495446266) internal successors, (785), 560 states have internal predecessors, (785), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 16:37:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 811 transitions. [2024-10-11 16:37:29,408 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 811 transitions. Word has length 139 [2024-10-11 16:37:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:37:29,410 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 811 transitions. [2024-10-11 16:37:29,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:37:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 811 transitions. [2024-10-11 16:37:29,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 16:37:29,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:29,415 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:37:29,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:37:29,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:29,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:29,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1197827462, now seen corresponding path program 1 times [2024-10-11 16:37:29,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:29,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363683093] [2024-10-11 16:37:29,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:29,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:37:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:29,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:37:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:29,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:37:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:29,809 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:37:29,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:37:29,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363683093] [2024-10-11 16:37:29,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363683093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:37:29,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:37:29,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:37:29,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438085870] [2024-10-11 16:37:29,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:37:29,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:37:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:37:29,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:37:29,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:37:29,818 INFO L87 Difference]: Start difference. First operand 566 states and 811 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:37:30,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:37:30,157 INFO L93 Difference]: Finished difference Result 803 states and 1164 transitions. [2024-10-11 16:37:30,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:37:30,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-10-11 16:37:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:37:30,161 INFO L225 Difference]: With dead ends: 803 [2024-10-11 16:37:30,161 INFO L226 Difference]: Without dead ends: 484 [2024-10-11 16:37:30,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:37:30,163 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 37 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:37:30,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1317 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:37:30,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-11 16:37:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 482. [2024-10-11 16:37:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 465 states have (on average 1.356989247311828) internal successors, (631), 476 states have internal predecessors, (631), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 16:37:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 657 transitions. [2024-10-11 16:37:30,178 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 657 transitions. Word has length 152 [2024-10-11 16:37:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:37:30,179 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 657 transitions. [2024-10-11 16:37:30,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:37:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 657 transitions. [2024-10-11 16:37:30,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 16:37:30,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:30,181 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:37:30,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:37:30,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:30,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:30,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1925625710, now seen corresponding path program 1 times [2024-10-11 16:37:30,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:30,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544968555] [2024-10-11 16:37:30,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:30,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:37:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:30,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:37:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:30,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:37:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:30,503 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:37:30,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:37:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544968555] [2024-10-11 16:37:30,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544968555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:37:30,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:37:30,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:37:30,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928830168] [2024-10-11 16:37:30,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:37:30,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:37:30,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:37:30,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:37:30,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:37:30,505 INFO L87 Difference]: Start difference. First operand 482 states and 657 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:37:31,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:37:31,068 INFO L93 Difference]: Finished difference Result 955 states and 1305 transitions. [2024-10-11 16:37:31,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:37:31,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-10-11 16:37:31,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:37:31,074 INFO L225 Difference]: With dead ends: 955 [2024-10-11 16:37:31,074 INFO L226 Difference]: Without dead ends: 563 [2024-10-11 16:37:31,075 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:37:31,077 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 1184 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:37:31,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 1296 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:37:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-10-11 16:37:31,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 379. [2024-10-11 16:37:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 367 states have (on average 1.3460490463215258) internal successors, (494), 373 states have internal predecessors, (494), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 16:37:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 510 transitions. [2024-10-11 16:37:31,095 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 510 transitions. Word has length 152 [2024-10-11 16:37:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:37:31,096 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 510 transitions. [2024-10-11 16:37:31,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:37:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 510 transitions. [2024-10-11 16:37:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 16:37:31,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:31,098 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:37:31,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:37:31,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:31,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:31,099 INFO L85 PathProgramCache]: Analyzing trace with hash -193055838, now seen corresponding path program 1 times [2024-10-11 16:37:31,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:31,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234242115] [2024-10-11 16:37:31,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:31,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:37:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:31,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:37:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:31,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:37:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:37:31,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:37:31,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234242115] [2024-10-11 16:37:31,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234242115] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:37:31,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513611009] [2024-10-11 16:37:31,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:31,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:37:31,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:37:31,938 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:37:31,939 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:37:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:32,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 16:37:32,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:37:32,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 16:37:32,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:37:32,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 16:37:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:37:32,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:37:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:37:32,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513611009] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:37:32,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:37:32,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2024-10-11 16:37:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436179471] [2024-10-11 16:37:32,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:37:32,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 16:37:32,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:37:32,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 16:37:32,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:37:32,826 INFO L87 Difference]: Start difference. First operand 379 states and 510 transitions. Second operand has 12 states, 12 states have (on average 20.5) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 16:37:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:37:33,513 INFO L93 Difference]: Finished difference Result 1262 states and 1713 transitions. [2024-10-11 16:37:33,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 16:37:33,514 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.5) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 162 [2024-10-11 16:37:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:37:33,519 INFO L225 Difference]: With dead ends: 1262 [2024-10-11 16:37:33,519 INFO L226 Difference]: Without dead ends: 1129 [2024-10-11 16:37:33,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-11 16:37:33,521 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 2330 mSDsluCounter, 2332 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2352 SdHoareTripleChecker+Valid, 2726 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:37:33,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2352 Valid, 2726 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:37:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2024-10-11 16:37:33,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 725. [2024-10-11 16:37:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 709 states have (on average 1.3399153737658673) internal successors, (950), 715 states have internal predecessors, (950), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 16:37:33,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 972 transitions. [2024-10-11 16:37:33,559 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 972 transitions. Word has length 162 [2024-10-11 16:37:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:37:33,559 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 972 transitions. [2024-10-11 16:37:33,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.5) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 16:37:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 972 transitions. [2024-10-11 16:37:33,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-10-11 16:37:33,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:33,567 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:37:33,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 16:37:33,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:37:33,769 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:33,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1240250025, now seen corresponding path program 1 times [2024-10-11 16:37:33,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:33,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305055163] [2024-10-11 16:37:33,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:33,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:37:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:37,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:37:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:37,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:37:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:37:37,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:37:37,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305055163] [2024-10-11 16:37:37,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305055163] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:37:37,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850359701] [2024-10-11 16:37:37,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:37,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:37:37,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:37:37,702 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:37:37,704 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:37:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:38,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 16:37:38,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:37:38,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 16:37:38,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:37:38,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:37:38,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:37:38,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:37:38,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 16:37:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:37:38,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:37:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:37:39,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850359701] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:37:39,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:37:39,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2024-10-11 16:37:39,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214664417] [2024-10-11 16:37:39,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:37:39,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 16:37:39,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:37:39,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 16:37:39,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2024-10-11 16:37:39,579 INFO L87 Difference]: Start difference. First operand 725 states and 972 transitions. Second operand has 20 states, 20 states have (on average 35.3) internal successors, (706), 19 states have internal predecessors, (706), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 16:37:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:37:40,663 INFO L93 Difference]: Finished difference Result 2504 states and 3405 transitions. [2024-10-11 16:37:40,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 16:37:40,664 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 35.3) internal successors, (706), 19 states have internal predecessors, (706), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 390 [2024-10-11 16:37:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:37:40,675 INFO L225 Difference]: With dead ends: 2504 [2024-10-11 16:37:40,675 INFO L226 Difference]: Without dead ends: 2371 [2024-10-11 16:37:40,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 775 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2024-10-11 16:37:40,677 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 4048 mSDsluCounter, 4782 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4097 SdHoareTripleChecker+Valid, 5176 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:37:40,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4097 Valid, 5176 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:37:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2024-10-11 16:37:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 1589. [2024-10-11 16:37:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1567 states have (on average 1.337587747287811) internal successors, (2096), 1573 states have internal predecessors, (2096), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 16:37:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2130 transitions. [2024-10-11 16:37:40,756 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2130 transitions. Word has length 390 [2024-10-11 16:37:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:37:40,757 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2130 transitions. [2024-10-11 16:37:40,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.3) internal successors, (706), 19 states have internal predecessors, (706), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 16:37:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2130 transitions. [2024-10-11 16:37:40,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-10-11 16:37:40,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:40,781 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:37:40,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 16:37:40,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:37:40,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:40,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:40,987 INFO L85 PathProgramCache]: Analyzing trace with hash -861020617, now seen corresponding path program 2 times [2024-10-11 16:37:40,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:40,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250818007] [2024-10-11 16:37:40,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:40,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms