./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:12:06,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:12:06,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 06:12:06,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:12:06,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:12:06,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:12:06,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:12:06,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:12:06,220 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 06:12:06,221 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 06:12:06,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:12:06,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:12:06,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:12:06,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:12:06,223 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:12:06,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:12:06,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:12:06,224 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:12:06,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:12:06,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:12:06,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:12:06,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:12:06,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:12:06,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:12:06,230 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:12:06,230 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:12:06,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:12:06,231 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:12:06,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:12:06,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:12:06,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:12:06,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:12:06,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:12:06,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:12:06,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:12:06,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:12:06,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:12:06,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:12:06,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:12:06,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:12:06,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:12:06,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:12:06,235 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/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/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 -> 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 [2024-11-09 06:12:06,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:12:06,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:12:06,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:12:06,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:12:06,543 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:12:06,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2024-11-09 06:12:08,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:12:08,455 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:12:08,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2024-11-09 06:12:08,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce139712b/fe542854bb7249f891341db7eab6c460/FLAG73cadfb76 [2024-11-09 06:12:08,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce139712b/fe542854bb7249f891341db7eab6c460 [2024-11-09 06:12:08,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:12:08,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:12:08,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:12:08,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:12:08,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:12:08,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:12:08" (1/1) ... [2024-11-09 06:12:08,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79cff6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:12:08, skipping insertion in model container [2024-11-09 06:12:08,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:12:08" (1/1) ... [2024-11-09 06:12:08,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:12:09,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[33021,33034] [2024-11-09 06:12:09,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44124,44137] [2024-11-09 06:12:09,170 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44245,44258] [2024-11-09 06:12:09,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:12:09,192 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:12:09,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[33021,33034] [2024-11-09 06:12:09,302 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44124,44137] [2024-11-09 06:12:09,303 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44245,44258] [2024-11-09 06:12:09,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:12:09,359 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:12:09,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:12:09 WrapperNode [2024-11-09 06:12:09,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:12:09,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:12:09,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:12:09,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:12:09,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:12:09" (1/1) ... [2024-11-09 06:12:09,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:12:09" (1/1) ... [2024-11-09 06:12:09,505 INFO L138 Inliner]: procedures = 176, calls = 269, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1423 [2024-11-09 06:12:09,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:12:09,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:12:09,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:12:09,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:12:09,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:12:09" (1/1) ... [2024-11-09 06:12:09,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:12:09" (1/1) ... [2024-11-09 06:12:09,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:12:09" (1/1) ... [2024-11-09 06:12:09,648 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 34, 217]. 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, 4, 50]. [2024-11-09 06:12:09,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:12:09" (1/1) ... [2024-11-09 06:12:09,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:12:09" (1/1) ... [2024-11-09 06:12:09,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:12:09" (1/1) ... [2024-11-09 06:12:09,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:12:09" (1/1) ... [2024-11-09 06:12:09,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:12:09" (1/1) ... [2024-11-09 06:12:09,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:12:09" (1/1) ... [2024-11-09 06:12:09,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:12:09,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:12:09,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:12:09,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:12:09,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:12:09" (1/1) ... [2024-11-09 06:12:09,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:12:09,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:12:09,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 06:12:09,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 06:12:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 06:12:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 06:12:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 06:12:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 06:12:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 06:12:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 06:12:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 06:12:09,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 06:12:09,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 06:12:09,907 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 06:12:09,907 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 06:12:09,908 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 06:12:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:12:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:12:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 06:12:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 06:12:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 06:12:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:12:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 06:12:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 06:12:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 06:12:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:12:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 06:12:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 06:12:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 06:12:09,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:12:09,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:12:10,215 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:12:10,218 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:12:11,797 INFO L? ?]: Removed 309 outVars from TransFormulas that were not future-live. [2024-11-09 06:12:11,797 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:12:11,831 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:12:11,832 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-09 06:12:11,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:12:11 BoogieIcfgContainer [2024-11-09 06:12:11,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:12:11,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:12:11,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:12:11,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:12:11,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:12:08" (1/3) ... [2024-11-09 06:12:11,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c38b04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:12:11, skipping insertion in model container [2024-11-09 06:12:11,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:12:09" (2/3) ... [2024-11-09 06:12:11,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c38b04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:12:11, skipping insertion in model container [2024-11-09 06:12:11,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:12:11" (3/3) ... [2024-11-09 06:12:11,845 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test7-1.i [2024-11-09 06:12:11,863 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:12:11,863 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 06:12:11,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:12:11,953 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;@3b41ce1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:12:11,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 06:12:11,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 389 states have (on average 1.6246786632390746) internal successors, (632), 391 states have internal predecessors, (632), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:12:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 06:12:11,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:11,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:11,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:12:11,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:11,972 INFO L85 PathProgramCache]: Analyzing trace with hash -59717688, now seen corresponding path program 1 times [2024-11-09 06:12:11,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:12:11,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183819782] [2024-11-09 06:12:11,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:11,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:12,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:12:12,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183819782] [2024-11-09 06:12:12,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183819782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:12,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:12,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:12:12,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475517517] [2024-11-09 06:12:12,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:12,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 06:12:12,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:12:12,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 06:12:12,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:12:12,228 INFO L87 Difference]: Start difference. First operand has 396 states, 389 states have (on average 1.6246786632390746) internal successors, (632), 391 states have internal predecessors, (632), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 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-11-09 06:12:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:12,308 INFO L93 Difference]: Finished difference Result 789 states and 1273 transitions. [2024-11-09 06:12:12,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 06:12:12,312 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-11-09 06:12:12,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:12,330 INFO L225 Difference]: With dead ends: 789 [2024-11-09 06:12:12,331 INFO L226 Difference]: Without dead ends: 391 [2024-11-09 06:12:12,339 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-11-09 06:12:12,346 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:12,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:12:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-09 06:12:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-09 06:12:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 385 states have (on average 1.4493506493506494) internal successors, (558), 386 states have internal predecessors, (558), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:12:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 564 transitions. [2024-11-09 06:12:12,422 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 564 transitions. Word has length 8 [2024-11-09 06:12:12,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:12,423 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 564 transitions. [2024-11-09 06:12:12,423 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-11-09 06:12:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 564 transitions. [2024-11-09 06:12:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 06:12:12,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:12,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:12,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:12:12,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:12:12,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:12,429 INFO L85 PathProgramCache]: Analyzing trace with hash -690874686, now seen corresponding path program 1 times [2024-11-09 06:12:12,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:12:12,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857609120] [2024-11-09 06:12:12,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:12,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:12,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:12:12,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857609120] [2024-11-09 06:12:12,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857609120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:12,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:12,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:12:12,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141429514] [2024-11-09 06:12:12,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:12,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:12:12,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:12:12,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:12:12,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:12:12,662 INFO L87 Difference]: Start difference. First operand 391 states and 564 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:12,829 INFO L93 Difference]: Finished difference Result 965 states and 1396 transitions. [2024-11-09 06:12:12,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:12:12,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 06:12:12,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:12,837 INFO L225 Difference]: With dead ends: 965 [2024-11-09 06:12:12,837 INFO L226 Difference]: Without dead ends: 775 [2024-11-09 06:12:12,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:12:12,841 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 548 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:12,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1715 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:12:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-09 06:12:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 393. [2024-11-09 06:12:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 387 states have (on average 1.4470284237726099) internal successors, (560), 388 states have internal predecessors, (560), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:12:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 566 transitions. [2024-11-09 06:12:12,882 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 566 transitions. Word has length 10 [2024-11-09 06:12:12,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:12,883 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 566 transitions. [2024-11-09 06:12:12,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 566 transitions. [2024-11-09 06:12:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 06:12:12,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:12,886 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] [2024-11-09 06:12:12,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:12:12,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:12:12,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:12,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1711501341, now seen corresponding path program 1 times [2024-11-09 06:12:12,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:12:12,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996292823] [2024-11-09 06:12:12,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:12,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:13,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:12:13,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996292823] [2024-11-09 06:12:13,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996292823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:13,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:13,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:12:13,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475450625] [2024-11-09 06:12:13,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:13,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:12:13,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:12:13,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:12:13,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:12:13,380 INFO L87 Difference]: Start difference. First operand 393 states and 566 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-11-09 06:12:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:13,476 INFO L93 Difference]: Finished difference Result 740 states and 1062 transitions. [2024-11-09 06:12:13,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:12:13,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 86 [2024-11-09 06:12:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:13,479 INFO L225 Difference]: With dead ends: 740 [2024-11-09 06:12:13,479 INFO L226 Difference]: Without dead ends: 351 [2024-11-09 06:12:13,482 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-11-09 06:12:13,483 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 30 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:13,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1367 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:12:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-09 06:12:13,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-11-09 06:12:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 345 states have (on average 1.4) internal successors, (483), 346 states have internal predecessors, (483), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:12:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 489 transitions. [2024-11-09 06:12:13,506 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 489 transitions. Word has length 86 [2024-11-09 06:12:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:13,506 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 489 transitions. [2024-11-09 06:12:13,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-11-09 06:12:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 489 transitions. [2024-11-09 06:12:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 06:12:13,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:13,511 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] [2024-11-09 06:12:13,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:12:13,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:12:13,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:13,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1955782545, now seen corresponding path program 1 times [2024-11-09 06:12:13,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:12:13,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503374885] [2024-11-09 06:12:13,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:13,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:13,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:12:13,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503374885] [2024-11-09 06:12:13,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503374885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:13,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:13,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:12:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557321843] [2024-11-09 06:12:13,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:13,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:12:13,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:12:13,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:12:13,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:12:13,826 INFO L87 Difference]: Start difference. First operand 351 states and 489 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-11-09 06:12:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:13,939 INFO L93 Difference]: Finished difference Result 949 states and 1335 transitions. [2024-11-09 06:12:13,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:12:13,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 86 [2024-11-09 06:12:13,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:13,944 INFO L225 Difference]: With dead ends: 949 [2024-11-09 06:12:13,945 INFO L226 Difference]: Without dead ends: 602 [2024-11-09 06:12:13,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-09 06:12:13,949 INFO L432 NwaCegarLoop]: 667 mSDtfsCounter, 295 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:13,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1124 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:12:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-09 06:12:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 598. [2024-11-09 06:12:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 592 states have (on average 1.4172297297297298) internal successors, (839), 593 states have internal predecessors, (839), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:12:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 845 transitions. [2024-11-09 06:12:13,972 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 845 transitions. Word has length 86 [2024-11-09 06:12:13,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:13,973 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 845 transitions. [2024-11-09 06:12:13,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-11-09 06:12:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 845 transitions. [2024-11-09 06:12:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 06:12:13,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:13,981 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:13,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:12:13,982 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:12:13,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:13,983 INFO L85 PathProgramCache]: Analyzing trace with hash 866571143, now seen corresponding path program 1 times [2024-11-09 06:12:13,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:12:13,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085199849] [2024-11-09 06:12:13,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:13,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:14,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:12:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:14,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:12:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:12:14,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:12:14,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085199849] [2024-11-09 06:12:14,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085199849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:14,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:14,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:12:14,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636751209] [2024-11-09 06:12:14,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:14,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:12:14,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:12:14,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:12:14,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:12:14,591 INFO L87 Difference]: Start difference. First operand 598 states and 845 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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-11-09 06:12:14,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:14,990 INFO L93 Difference]: Finished difference Result 883 states and 1252 transitions. [2024-11-09 06:12:14,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:12:14,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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 101 [2024-11-09 06:12:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:14,999 INFO L225 Difference]: With dead ends: 883 [2024-11-09 06:12:14,999 INFO L226 Difference]: Without dead ends: 879 [2024-11-09 06:12:15,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:12:15,003 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 461 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:15,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1879 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:12:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-11-09 06:12:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 600. [2024-11-09 06:12:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 594 states have (on average 1.4158249158249159) internal successors, (841), 595 states have internal predecessors, (841), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:12:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 847 transitions. [2024-11-09 06:12:15,029 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 847 transitions. Word has length 101 [2024-11-09 06:12:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:15,033 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 847 transitions. [2024-11-09 06:12:15,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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-11-09 06:12:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 847 transitions. [2024-11-09 06:12:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 06:12:15,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:15,040 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:15,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:12:15,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:12:15,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:15,041 INFO L85 PathProgramCache]: Analyzing trace with hash 841701064, now seen corresponding path program 1 times [2024-11-09 06:12:15,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:12:15,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781389205] [2024-11-09 06:12:15,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:15,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:15,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:12:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:15,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:12:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:12:15,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:12:15,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781389205] [2024-11-09 06:12:15,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781389205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:15,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:15,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:12:15,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431542645] [2024-11-09 06:12:15,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:15,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:12:15,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:12:15,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:12:15,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:12:15,465 INFO L87 Difference]: Start difference. First operand 600 states and 847 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 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-11-09 06:12:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:15,821 INFO L93 Difference]: Finished difference Result 868 states and 1233 transitions. [2024-11-09 06:12:15,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:12:15,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 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 155 [2024-11-09 06:12:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:15,827 INFO L225 Difference]: With dead ends: 868 [2024-11-09 06:12:15,827 INFO L226 Difference]: Without dead ends: 519 [2024-11-09 06:12:15,829 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-11-09 06:12:15,830 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 33 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:15,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1422 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:12:15,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-09 06:12:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 516. [2024-11-09 06:12:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 510 states have (on average 1.3470588235294119) internal successors, (687), 511 states have internal predecessors, (687), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:12:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 693 transitions. [2024-11-09 06:12:15,853 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 693 transitions. Word has length 155 [2024-11-09 06:12:15,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:15,854 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 693 transitions. [2024-11-09 06:12:15,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 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-11-09 06:12:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 693 transitions. [2024-11-09 06:12:15,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 06:12:15,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:15,860 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:15,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:12:15,860 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:12:15,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:15,861 INFO L85 PathProgramCache]: Analyzing trace with hash -329813060, now seen corresponding path program 1 times [2024-11-09 06:12:15,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:12:15,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115223604] [2024-11-09 06:12:15,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:15,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:16,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:12:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:16,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:12:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:12:16,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:12:16,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115223604] [2024-11-09 06:12:16,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115223604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:16,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:16,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:12:16,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242182139] [2024-11-09 06:12:16,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:16,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:12:16,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:12:16,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:12:16,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:12:16,290 INFO L87 Difference]: Start difference. First operand 516 states and 693 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:12:16,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:16,914 INFO L93 Difference]: Finished difference Result 1291 states and 1738 transitions. [2024-11-09 06:12:16,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:12:16,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-09 06:12:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:16,920 INFO L225 Difference]: With dead ends: 1291 [2024-11-09 06:12:16,921 INFO L226 Difference]: Without dead ends: 866 [2024-11-09 06:12:16,922 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-11-09 06:12:16,923 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 913 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:16,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 1860 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:12:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-11-09 06:12:16,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 655. [2024-11-09 06:12:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 649 states have (on average 1.349768875192604) internal successors, (876), 650 states have internal predecessors, (876), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:12:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 882 transitions. [2024-11-09 06:12:16,952 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 882 transitions. Word has length 155 [2024-11-09 06:12:16,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:16,952 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 882 transitions. [2024-11-09 06:12:16,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:12:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 882 transitions. [2024-11-09 06:12:16,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 06:12:16,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:16,955 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:16,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:12:16,955 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:12:16,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:16,956 INFO L85 PathProgramCache]: Analyzing trace with hash 470214256, now seen corresponding path program 1 times [2024-11-09 06:12:16,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:12:16,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636586410] [2024-11-09 06:12:16,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:16,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:12:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:18,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:12:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:12:18,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:12:18,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636586410] [2024-11-09 06:12:18,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636586410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:12:18,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530677281] [2024-11-09 06:12:18,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:18,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:12:18,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:12:18,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:12:18,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:12:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:18,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:12:18,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:12:18,542 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-11-09 06:12:18,833 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-11-09 06:12:18,846 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-11-09 06:12:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:12:18,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:12:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:12:19,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530677281] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:12:19,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:12:19,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2024-11-09 06:12:19,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482612058] [2024-11-09 06:12:19,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:12:19,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:12:19,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:12:19,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:12:19,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:12:19,096 INFO L87 Difference]: Start difference. First operand 655 states and 882 transitions. Second operand has 12 states, 12 states have (on average 20.75) internal successors, (249), 11 states have internal predecessors, (249), 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-11-09 06:12:19,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:19,729 INFO L93 Difference]: Finished difference Result 2935 states and 3968 transitions. [2024-11-09 06:12:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:12:19,731 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.75) internal successors, (249), 11 states have internal predecessors, (249), 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 165 [2024-11-09 06:12:19,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:19,742 INFO L225 Difference]: With dead ends: 2935 [2024-11-09 06:12:19,742 INFO L226 Difference]: Without dead ends: 2528 [2024-11-09 06:12:19,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 327 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-11-09 06:12:19,746 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 1985 mSDsluCounter, 3074 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1997 SdHoareTripleChecker+Valid, 3500 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:19,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1997 Valid, 3500 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:12:19,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2024-11-09 06:12:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 1002. [2024-11-09 06:12:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 992 states have (on average 1.34375) internal successors, (1333), 993 states have internal predecessors, (1333), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:12:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1345 transitions. [2024-11-09 06:12:19,810 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1345 transitions. Word has length 165 [2024-11-09 06:12:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:19,810 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1345 transitions. [2024-11-09 06:12:19,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.75) internal successors, (249), 11 states have internal predecessors, (249), 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-11-09 06:12:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1345 transitions. [2024-11-09 06:12:19,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-09 06:12:19,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:19,817 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:19,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 06:12:20,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:12:20,018 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:12:20,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:20,019 INFO L85 PathProgramCache]: Analyzing trace with hash 36522615, now seen corresponding path program 1 times [2024-11-09 06:12:20,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:12:20,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661314694] [2024-11-09 06:12:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:20,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:24,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:12:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:24,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:12:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:12:24,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:12:24,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661314694] [2024-11-09 06:12:24,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661314694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:12:24,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213189010] [2024-11-09 06:12:24,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:24,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:12:24,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:12:24,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:12:24,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:12:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:25,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 1896 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 06:12:25,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:12:25,527 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-11-09 06:12:25,761 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-11-09 06:12:25,891 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-11-09 06:12:26,018 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-11-09 06:12:26,138 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-11-09 06:12:26,146 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-11-09 06:12:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:12:26,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:12:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:12:26,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213189010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:12:26,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:12:26,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2024-11-09 06:12:26,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973052487] [2024-11-09 06:12:26,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:12:26,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 06:12:26,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:12:26,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 06:12:26,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2024-11-09 06:12:26,750 INFO L87 Difference]: Start difference. First operand 1002 states and 1345 transitions. Second operand has 21 states, 21 states have (on average 33.857142857142854) internal successors, (711), 20 states have internal predecessors, (711), 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-11-09 06:12:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:27,971 INFO L93 Difference]: Finished difference Result 6223 states and 8423 transitions. [2024-11-09 06:12:27,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 06:12:27,972 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 33.857142857142854) internal successors, (711), 20 states have internal predecessors, (711), 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 393 [2024-11-09 06:12:27,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:28,000 INFO L225 Difference]: With dead ends: 6223 [2024-11-09 06:12:28,001 INFO L226 Difference]: Without dead ends: 5816 [2024-11-09 06:12:28,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 781 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2024-11-09 06:12:28,010 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 8514 mSDsluCounter, 4941 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8538 SdHoareTripleChecker+Valid, 5367 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:28,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8538 Valid, 5367 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:12:28,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5816 states. [2024-11-09 06:12:28,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5816 to 1866. [2024-11-09 06:12:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1850 states have (on average 1.34) internal successors, (2479), 1851 states have internal predecessors, (2479), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 06:12:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2503 transitions. [2024-11-09 06:12:28,157 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2503 transitions. Word has length 393 [2024-11-09 06:12:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:28,158 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 2503 transitions. [2024-11-09 06:12:28,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 33.857142857142854) internal successors, (711), 20 states have internal predecessors, (711), 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-11-09 06:12:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2503 transitions. [2024-11-09 06:12:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-11-09 06:12:28,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:28,180 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:28,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:12:28,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-09 06:12:28,382 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:12:28,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:28,382 INFO L85 PathProgramCache]: Analyzing trace with hash 520139781, now seen corresponding path program 2 times [2024-11-09 06:12:28,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:12:28,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315677736] [2024-11-09 06:12:28,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:28,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:43,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:12:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:43,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:12:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:12:43,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:12:43,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315677736] [2024-11-09 06:12:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315677736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:12:43,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465406210] [2024-11-09 06:12:43,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:12:43,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:12:43,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:12:43,161 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:12:43,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:12:43,980 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 06:12:43,980 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:12:43,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 06:12:44,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:12:44,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:12:44,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-09 06:12:44,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:12:44,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465406210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:44,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:12:44,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [26] total 33 [2024-11-09 06:12:44,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106220644] [2024-11-09 06:12:44,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:44,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:12:44,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:12:44,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:12:44,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 06:12:44,726 INFO L87 Difference]: Start difference. First operand 1866 states and 2503 transitions. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:12:45,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:45,684 INFO L93 Difference]: Finished difference Result 2450 states and 3286 transitions. [2024-11-09 06:12:45,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:12:45,686 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 849 [2024-11-09 06:12:45,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:45,695 INFO L225 Difference]: With dead ends: 2450 [2024-11-09 06:12:45,696 INFO L226 Difference]: Without dead ends: 2046 [2024-11-09 06:12:45,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 06:12:45,699 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 394 mSDsluCounter, 2169 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:45,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 2609 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:12:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2024-11-09 06:12:45,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1901. [2024-11-09 06:12:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1885 states have (on average 1.3358090185676392) internal successors, (2518), 1886 states have internal predecessors, (2518), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 06:12:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2542 transitions. [2024-11-09 06:12:45,772 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2542 transitions. Word has length 849 [2024-11-09 06:12:45,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:45,773 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 2542 transitions. [2024-11-09 06:12:45,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:12:45,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2542 transitions. [2024-11-09 06:12:45,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2024-11-09 06:12:45,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:45,793 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, 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] [2024-11-09 06:12:45,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 06:12:45,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:12:45,998 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:12:45,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:45,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2132372556, now seen corresponding path program 1 times [2024-11-09 06:12:45,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:12:45,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480041324] [2024-11-09 06:12:45,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:45,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:57,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:12:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:57,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:12:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:12:57,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:12:57,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480041324] [2024-11-09 06:12:57,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480041324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:12:57,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307777867] [2024-11-09 06:12:57,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:57,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:12:57,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:12:57,580 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:12:57,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:12:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:58,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 4159 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 06:12:59,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:12:59,018 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-11-09 06:12:59,200 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-11-09 06:12:59,302 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-11-09 06:12:59,402 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-11-09 06:12:59,505 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-11-09 06:12:59,605 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-11-09 06:12:59,693 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-11-09 06:12:59,794 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-11-09 06:12:59,888 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-11-09 06:12:59,995 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-11-09 06:13:00,099 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-11-09 06:13:00,102 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-11-09 06:13:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:13:00,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:13:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:13:01,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307777867] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:13:01,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:13:01,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 15, 14] total 39 [2024-11-09 06:13:01,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694109067] [2024-11-09 06:13:01,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:13:01,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 06:13:01,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:13:01,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 06:13:01,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=909, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 06:13:01,304 INFO L87 Difference]: Start difference. First operand 1901 states and 2542 transitions. Second operand has 39 states, 39 states have (on average 41.94871794871795) internal successors, (1636), 38 states have internal predecessors, (1636), 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-11-09 06:13:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:03,633 INFO L93 Difference]: Finished difference Result 12834 states and 17371 transitions. [2024-11-09 06:13:03,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-09 06:13:03,634 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 41.94871794871795) internal successors, (1636), 38 states have internal predecessors, (1636), 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 850 [2024-11-09 06:13:03,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:03,687 INFO L225 Difference]: With dead ends: 12834 [2024-11-09 06:13:03,687 INFO L226 Difference]: Without dead ends: 12392 [2024-11-09 06:13:03,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1746 GetRequests, 1693 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=878, Invalid=1774, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 06:13:03,699 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 15956 mSDsluCounter, 10110 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16004 SdHoareTripleChecker+Valid, 10536 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:03,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16004 Valid, 10536 Invalid, 572 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:13:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2024-11-09 06:13:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 3629. [2024-11-09 06:13:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3629 states, 3601 states have (on average 1.3357400722021662) internal successors, (4810), 3602 states have internal predecessors, (4810), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 06:13:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 4858 transitions. [2024-11-09 06:13:03,931 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 4858 transitions. Word has length 850 [2024-11-09 06:13:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:03,933 INFO L471 AbstractCegarLoop]: Abstraction has 3629 states and 4858 transitions. [2024-11-09 06:13:03,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 41.94871794871795) internal successors, (1636), 38 states have internal predecessors, (1636), 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-11-09 06:13:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 4858 transitions. [2024-11-09 06:13:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1763 [2024-11-09 06:13:04,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:04,029 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2024-11-09 06:13:04,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 06:13:04,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:13:04,231 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:13:04,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:04,232 INFO L85 PathProgramCache]: Analyzing trace with hash 583153328, now seen corresponding path program 2 times [2024-11-09 06:13:04,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:13:04,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943065320] [2024-11-09 06:13:04,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:04,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:13:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat