./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.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 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 14:42:31,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 14:42:31,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 14:42:31,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 14:42:31,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 14:42:31,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 14:42:31,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 14:42:31,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 14:42:31,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 14:42:31,478 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 14:42:31,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 14:42:31,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 14:42:31,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 14:42:31,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 14:42:31,482 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 14:42:31,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 14:42:31,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 14:42:31,483 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 14:42:31,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 14:42:31,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 14:42:31,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 14:42:31,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 14:42:31,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 14:42:31,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 14:42:31,488 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 14:42:31,489 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 14:42:31,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 14:42:31,489 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 14:42:31,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 14:42:31,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 14:42:31,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 14:42:31,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 14:42:31,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:42:31,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 14:42:31,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 14:42:31,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 14:42:31,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 14:42:31,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 14:42:31,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 14:42:31,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 14:42:31,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 14:42:31,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 14:42:31,493 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 -> 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 [2024-10-24 14:42:31,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 14:42:31,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 14:42:31,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 14:42:31,759 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 14:42:31,759 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 14:42:31,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2024-10-24 14:42:33,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 14:42:33,494 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 14:42:33,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2024-10-24 14:42:33,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263caa3d5/989ca89284c64278a327364fcebeba0f/FLAGaf08a867a [2024-10-24 14:42:33,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263caa3d5/989ca89284c64278a327364fcebeba0f [2024-10-24 14:42:33,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 14:42:33,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 14:42:33,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 14:42:33,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 14:42:33,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 14:42:33,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:42:33" (1/1) ... [2024-10-24 14:42:33,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ad1730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:33, skipping insertion in model container [2024-10-24 14:42:33,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:42:33" (1/1) ... [2024-10-24 14:42:33,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 14:42:34,246 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[33021,33034] [2024-10-24 14:42:34,351 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44124,44137] [2024-10-24 14:42:34,352 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44245,44258] [2024-10-24 14:42:34,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:42:34,388 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 14:42:34,415 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[33021,33034] [2024-10-24 14:42:34,460 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44124,44137] [2024-10-24 14:42:34,460 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44245,44258] [2024-10-24 14:42:34,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:42:34,520 INFO L204 MainTranslator]: Completed translation [2024-10-24 14:42:34,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:34 WrapperNode [2024-10-24 14:42:34,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 14:42:34,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 14:42:34,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 14:42:34,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 14:42:34,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:34" (1/1) ... [2024-10-24 14:42:34,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:34" (1/1) ... [2024-10-24 14:42:34,642 INFO L138 Inliner]: procedures = 176, calls = 320, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1589 [2024-10-24 14:42:34,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 14:42:34,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 14:42:34,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 14:42:34,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 14:42:34,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:34" (1/1) ... [2024-10-24 14:42:34,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:34" (1/1) ... [2024-10-24 14:42:34,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:34" (1/1) ... [2024-10-24 14:42:34,848 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [265, 2, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 62 writes are split as follows [58, 0, 4]. [2024-10-24 14:42:34,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:34" (1/1) ... [2024-10-24 14:42:34,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:34" (1/1) ... [2024-10-24 14:42:34,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:34" (1/1) ... [2024-10-24 14:42:34,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:34" (1/1) ... [2024-10-24 14:42:34,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:34" (1/1) ... [2024-10-24 14:42:34,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:34" (1/1) ... [2024-10-24 14:42:34,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 14:42:34,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 14:42:34,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 14:42:34,940 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 14:42:34,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:34" (1/1) ... [2024-10-24 14:42:34,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:42:34,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:42:34,971 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-10-24 14:42:34,973 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-10-24 14:42:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 14:42:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 14:42:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 14:42:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 14:42:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 14:42:35,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 14:42:35,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 14:42:35,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 14:42:35,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 14:42:35,024 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 14:42:35,025 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 14:42:35,025 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 14:42:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 14:42:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 14:42:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 14:42:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 14:42:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 14:42:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 14:42:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 14:42:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 14:42:35,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 14:42:35,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 14:42:35,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 14:42:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 14:42:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 14:42:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 14:42:35,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 14:42:35,248 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 14:42:35,251 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 14:42:36,801 INFO L? ?]: Removed 334 outVars from TransFormulas that were not future-live. [2024-10-24 14:42:36,801 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 14:42:36,846 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 14:42:36,847 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-24 14:42:36,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:42:36 BoogieIcfgContainer [2024-10-24 14:42:36,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 14:42:36,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 14:42:36,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 14:42:36,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 14:42:36,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:42:33" (1/3) ... [2024-10-24 14:42:36,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c7670b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:42:36, skipping insertion in model container [2024-10-24 14:42:36,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:34" (2/3) ... [2024-10-24 14:42:36,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c7670b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:42:36, skipping insertion in model container [2024-10-24 14:42:36,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:42:36" (3/3) ... [2024-10-24 14:42:36,856 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-2.i [2024-10-24 14:42:36,872 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 14:42:36,872 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 14:42:36,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 14:42:36,958 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;@6ad23b72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 14:42:36,958 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 14:42:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 425 states, 418 states have (on average 1.6339712918660287) internal successors, (683), 420 states have internal predecessors, (683), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:42:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 14:42:36,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:42:36,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:42:36,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:42:36,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:42:36,974 INFO L85 PathProgramCache]: Analyzing trace with hash 115030448, now seen corresponding path program 1 times [2024-10-24 14:42:36,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:42:36,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956762697] [2024-10-24 14:42:36,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:42:36,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:42:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:42:37,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:42:37,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956762697] [2024-10-24 14:42:37,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956762697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:42:37,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:42:37,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 14:42:37,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335740923] [2024-10-24 14:42:37,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:42:37,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 14:42:37,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:42:37,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 14:42:37,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 14:42:37,211 INFO L87 Difference]: Start difference. First operand has 425 states, 418 states have (on average 1.6339712918660287) internal successors, (683), 420 states have internal predecessors, (683), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:42:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:42:37,296 INFO L93 Difference]: Finished difference Result 849 states and 1377 transitions. [2024-10-24 14:42:37,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 14:42:37,298 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-10-24 14:42:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:42:37,308 INFO L225 Difference]: With dead ends: 849 [2024-10-24 14:42:37,308 INFO L226 Difference]: Without dead ends: 389 [2024-10-24 14:42:37,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 14:42:37,315 INFO L432 NwaCegarLoop]: 607 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 14:42:37,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 607 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 14:42:37,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-24 14:42:37,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-10-24 14:42:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 383 states have (on average 1.4516971279373367) internal successors, (556), 384 states have internal predecessors, (556), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:42:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 562 transitions. [2024-10-24 14:42:37,374 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 562 transitions. Word has length 7 [2024-10-24 14:42:37,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:42:37,374 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 562 transitions. [2024-10-24 14:42:37,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:42:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 562 transitions. [2024-10-24 14:42:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 14:42:37,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:42:37,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:42:37,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 14:42:37,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:42:37,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:42:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash -261640534, now seen corresponding path program 1 times [2024-10-24 14:42:37,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:42:37,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524602419] [2024-10-24 14:42:37,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:42:37,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:42:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:42:37,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:42:37,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524602419] [2024-10-24 14:42:37,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524602419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:42:37,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:42:37,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 14:42:37,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406282722] [2024-10-24 14:42:37,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:42:37,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 14:42:37,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:42:37,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 14:42:37,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 14:42:37,591 INFO L87 Difference]: Start difference. First operand 389 states and 562 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:42:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:42:37,754 INFO L93 Difference]: Finished difference Result 963 states and 1394 transitions. [2024-10-24 14:42:37,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 14:42:37,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-10-24 14:42:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:42:37,761 INFO L225 Difference]: With dead ends: 963 [2024-10-24 14:42:37,761 INFO L226 Difference]: Without dead ends: 773 [2024-10-24 14:42:37,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 14:42:37,763 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 548 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:42:37,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1619 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 14:42:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-10-24 14:42:37,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 391. [2024-10-24 14:42:37,800 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-10-24 14:42:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 564 transitions. [2024-10-24 14:42:37,802 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 564 transitions. Word has length 9 [2024-10-24 14:42:37,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:42:37,802 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 564 transitions. [2024-10-24 14:42:37,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:42:37,803 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 564 transitions. [2024-10-24 14:42:37,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 14:42:37,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:42:37,806 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] [2024-10-24 14:42:37,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 14:42:37,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:42:37,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:42:37,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1540508619, now seen corresponding path program 1 times [2024-10-24 14:42:37,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:42:37,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144541885] [2024-10-24 14:42:37,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:42:37,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:42:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:42:38,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:42:38,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144541885] [2024-10-24 14:42:38,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144541885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:42:38,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:42:38,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 14:42:38,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109535817] [2024-10-24 14:42:38,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:42:38,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 14:42:38,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:42:38,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 14:42:38,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 14:42:38,257 INFO L87 Difference]: Start difference. First operand 391 states and 564 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:42:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:42:38,374 INFO L93 Difference]: Finished difference Result 737 states and 1059 transitions. [2024-10-24 14:42:38,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 14:42:38,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2024-10-24 14:42:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:42:38,378 INFO L225 Difference]: With dead ends: 737 [2024-10-24 14:42:38,378 INFO L226 Difference]: Without dead ends: 349 [2024-10-24 14:42:38,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 14:42:38,380 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 30 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:42:38,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1357 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 14:42:38,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-24 14:42:38,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-10-24 14:42:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 343 states have (on average 1.402332361516035) internal successors, (481), 344 states have internal predecessors, (481), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:42:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 487 transitions. [2024-10-24 14:42:38,400 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 487 transitions. Word has length 85 [2024-10-24 14:42:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:42:38,402 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 487 transitions. [2024-10-24 14:42:38,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:42:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 487 transitions. [2024-10-24 14:42:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 14:42:38,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:42:38,406 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] [2024-10-24 14:42:38,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 14:42:38,407 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:42:38,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:42:38,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1296227415, now seen corresponding path program 1 times [2024-10-24 14:42:38,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:42:38,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208405645] [2024-10-24 14:42:38,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:42:38,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:42:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:42:38,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:42:38,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208405645] [2024-10-24 14:42:38,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208405645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:42:38,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:42:38,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 14:42:38,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822871689] [2024-10-24 14:42:38,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:42:38,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 14:42:38,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:42:38,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 14:42:38,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 14:42:38,635 INFO L87 Difference]: Start difference. First operand 349 states and 487 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:42:38,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:42:38,746 INFO L93 Difference]: Finished difference Result 949 states and 1334 transitions. [2024-10-24 14:42:38,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 14:42:38,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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 85 [2024-10-24 14:42:38,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:42:38,752 INFO L225 Difference]: With dead ends: 949 [2024-10-24 14:42:38,752 INFO L226 Difference]: Without dead ends: 603 [2024-10-24 14:42:38,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 14:42:38,756 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 298 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:42:38,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1119 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 14:42:38,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-10-24 14:42:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 596. [2024-10-24 14:42:38,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 590 states have (on average 1.4186440677966101) internal successors, (837), 591 states have internal predecessors, (837), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:42:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 843 transitions. [2024-10-24 14:42:38,813 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 843 transitions. Word has length 85 [2024-10-24 14:42:38,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:42:38,815 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 843 transitions. [2024-10-24 14:42:38,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:42:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 843 transitions. [2024-10-24 14:42:38,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 14:42:38,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:42:38,817 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:42:38,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 14:42:38,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:42:38,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:42:38,822 INFO L85 PathProgramCache]: Analyzing trace with hash 113068153, now seen corresponding path program 1 times [2024-10-24 14:42:38,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:42:38,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834873640] [2024-10-24 14:42:38,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:42:38,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:42:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:39,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:42:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:39,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 14:42:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 14:42:39,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:42:39,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834873640] [2024-10-24 14:42:39,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834873640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:42:39,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:42:39,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 14:42:39,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390885679] [2024-10-24 14:42:39,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:42:39,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 14:42:39,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:42:39,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 14:42:39,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 14:42:39,308 INFO L87 Difference]: Start difference. First operand 596 states and 843 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:42:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:42:39,770 INFO L93 Difference]: Finished difference Result 880 states and 1249 transitions. [2024-10-24 14:42:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 14:42:39,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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 98 [2024-10-24 14:42:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:42:39,777 INFO L225 Difference]: With dead ends: 880 [2024-10-24 14:42:39,777 INFO L226 Difference]: Without dead ends: 876 [2024-10-24 14:42:39,778 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-10-24 14:42:39,779 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 460 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:42:39,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1865 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 14:42:39,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-10-24 14:42:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 598. [2024-10-24 14:42:39,799 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-10-24 14:42:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 845 transitions. [2024-10-24 14:42:39,802 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 845 transitions. Word has length 98 [2024-10-24 14:42:39,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:42:39,804 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 845 transitions. [2024-10-24 14:42:39,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:42:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 845 transitions. [2024-10-24 14:42:39,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-24 14:42:39,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:42:39,810 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:42:39,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 14:42:39,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:42:39,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:42:39,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1629184570, now seen corresponding path program 1 times [2024-10-24 14:42:39,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:42:39,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716659346] [2024-10-24 14:42:39,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:42:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:42:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:40,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:42:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:40,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 14:42:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 14:42:40,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:42:40,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716659346] [2024-10-24 14:42:40,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716659346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:42:40,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:42:40,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 14:42:40,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254494975] [2024-10-24 14:42:40,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:42:40,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 14:42:40,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:42:40,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 14:42:40,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 14:42:40,170 INFO L87 Difference]: Start difference. First operand 598 states and 845 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:42:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:42:40,474 INFO L93 Difference]: Finished difference Result 865 states and 1230 transitions. [2024-10-24 14:42:40,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 14:42:40,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-10-24 14:42:40,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:42:40,477 INFO L225 Difference]: With dead ends: 865 [2024-10-24 14:42:40,477 INFO L226 Difference]: Without dead ends: 516 [2024-10-24 14:42:40,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:42:40,481 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 32 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:42:40,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1408 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 14:42:40,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-24 14:42:40,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 514. [2024-10-24 14:42:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 508 states have (on average 1.3484251968503937) internal successors, (685), 509 states have internal predecessors, (685), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:42:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 691 transitions. [2024-10-24 14:42:40,496 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 691 transitions. Word has length 152 [2024-10-24 14:42:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:42:40,497 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 691 transitions. [2024-10-24 14:42:40,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:42:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 691 transitions. [2024-10-24 14:42:40,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-24 14:42:40,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:42:40,502 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:42:40,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 14:42:40,503 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:42:40,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:42:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash 457670446, now seen corresponding path program 1 times [2024-10-24 14:42:40,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:42:40,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690218911] [2024-10-24 14:42:40,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:42:40,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:42:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:40,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:42:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:40,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 14:42:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:42:40,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:42:40,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690218911] [2024-10-24 14:42:40,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690218911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:42:40,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:42:40,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:42:40,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533614531] [2024-10-24 14:42:40,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:42:40,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:42:40,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:42:40,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:42:40,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:42:40,837 INFO L87 Difference]: Start difference. First operand 514 states and 691 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:42:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:42:41,328 INFO L93 Difference]: Finished difference Result 1287 states and 1734 transitions. [2024-10-24 14:42:41,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 14:42:41,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-10-24 14:42:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:42:41,333 INFO L225 Difference]: With dead ends: 1287 [2024-10-24 14:42:41,333 INFO L226 Difference]: Without dead ends: 863 [2024-10-24 14:42:41,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:42:41,335 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 1343 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:42:41,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 1522 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 14:42:41,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-10-24 14:42:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 653. [2024-10-24 14:42:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 647 states have (on average 1.3508500772797527) internal successors, (874), 648 states have internal predecessors, (874), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:42:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 880 transitions. [2024-10-24 14:42:41,357 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 880 transitions. Word has length 152 [2024-10-24 14:42:41,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:42:41,357 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 880 transitions. [2024-10-24 14:42:41,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:42:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 880 transitions. [2024-10-24 14:42:41,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 14:42:41,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:42:41,360 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:42:41,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 14:42:41,360 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:42:41,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:42:41,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2139305118, now seen corresponding path program 1 times [2024-10-24 14:42:41,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:42:41,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292157780] [2024-10-24 14:42:41,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:42:41,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:42:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:42:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:42,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 14:42:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:42,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:42:42,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:42:42,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292157780] [2024-10-24 14:42:42,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292157780] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:42:42,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22562962] [2024-10-24 14:42:42,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:42:42,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:42:42,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:42:42,134 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-10-24 14:42:42,136 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-10-24 14:42:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:42,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 14:42:42,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:42:42,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-10-24 14:42:42,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:42:42,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-24 14:42:42,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:42:42,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 14:42:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:42:42,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22562962] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 14:42:42,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 14:42:42,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2024-10-24 14:42:42,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162181987] [2024-10-24 14:42:42,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 14:42:42,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 14:42:42,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:42:42,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 14:42:42,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-24 14:42:42,999 INFO L87 Difference]: Start difference. First operand 653 states and 880 transitions. Second operand has 12 states, 12 states have (on average 20.5) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 14:42:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:42:43,545 INFO L93 Difference]: Finished difference Result 2930 states and 3963 transitions. [2024-10-24 14:42:43,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 14:42:43,547 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.5) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 162 [2024-10-24 14:42:43,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:42:43,558 INFO L225 Difference]: With dead ends: 2930 [2024-10-24 14:42:43,558 INFO L226 Difference]: Without dead ends: 2523 [2024-10-24 14:42:43,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-24 14:42:43,561 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 2243 mSDsluCounter, 2631 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2255 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:42:43,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2255 Valid, 3053 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 14:42:43,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2024-10-24 14:42:43,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 999. [2024-10-24 14:42:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 989 states have (on average 1.3447927199191103) internal successors, (1330), 990 states have internal predecessors, (1330), 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-10-24 14:42:43,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1342 transitions. [2024-10-24 14:42:43,644 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1342 transitions. Word has length 162 [2024-10-24 14:42:43,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:42:43,644 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1342 transitions. [2024-10-24 14:42:43,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.5) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 14:42:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1342 transitions. [2024-10-24 14:42:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-10-24 14:42:43,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:42:43,652 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:42:43,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 14:42:43,852 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-10-24 14:42:43,853 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:42:43,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:42:43,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1465740905, now seen corresponding path program 1 times [2024-10-24 14:42:43,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:42:43,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154151239] [2024-10-24 14:42:43,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:42:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:42:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:47,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:42:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:47,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 14:42:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:42:47,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:42:47,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154151239] [2024-10-24 14:42:47,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154151239] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:42:47,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898632925] [2024-10-24 14:42:47,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:42:47,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:42:47,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:42:47,469 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-10-24 14:42:47,471 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-10-24 14:42:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:42:48,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 1896 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 14:42:48,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:42:48,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 14:42:48,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:42:48,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:42:48,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:42:48,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:42:48,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-24 14:42:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:42:48,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 14:42:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:42:49,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898632925] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 14:42:49,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 14:42:49,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2024-10-24 14:42:49,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696175296] [2024-10-24 14:42:49,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 14:42:49,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 14:42:49,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:42:49,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 14:42:49,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2024-10-24 14:42:49,369 INFO L87 Difference]: Start difference. First operand 999 states and 1342 transitions. Second operand has 20 states, 20 states have (on average 35.3) internal successors, (706), 19 states have internal predecessors, (706), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 14:42:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:42:50,333 INFO L93 Difference]: Finished difference Result 6218 states and 8418 transitions. [2024-10-24 14:42:50,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-24 14:42:50,334 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 35.3) internal successors, (706), 19 states have internal predecessors, (706), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 390 [2024-10-24 14:42:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:42:50,356 INFO L225 Difference]: With dead ends: 6218 [2024-10-24 14:42:50,356 INFO L226 Difference]: Without dead ends: 5811 [2024-10-24 14:42:50,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 802 GetRequests, 773 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2024-10-24 14:42:50,361 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 6248 mSDsluCounter, 5408 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6272 SdHoareTripleChecker+Valid, 5830 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 14:42:50,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6272 Valid, 5830 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 14:42:50,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5811 states. [2024-10-24 14:42:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5811 to 1863. [2024-10-24 14:42:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1863 states, 1847 states have (on average 1.3405522468868436) internal successors, (2476), 1848 states have internal predecessors, (2476), 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-10-24 14:42:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2500 transitions. [2024-10-24 14:42:50,471 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 2500 transitions. Word has length 390 [2024-10-24 14:42:50,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:42:50,472 INFO L471 AbstractCegarLoop]: Abstraction has 1863 states and 2500 transitions. [2024-10-24 14:42:50,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.3) internal successors, (706), 19 states have internal predecessors, (706), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 14:42:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2500 transitions. [2024-10-24 14:42:50,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-10-24 14:42:50,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:42:50,509 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:42:50,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 14:42:50,709 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-10-24 14:42:50,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:42:50,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:42:50,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1202530825, now seen corresponding path program 2 times [2024-10-24 14:42:50,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:42:50,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141226782] [2024-10-24 14:42:50,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:42:50,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:42:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:43:01,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:43:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:43:01,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 14:43:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:43:01,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:43:01,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:43:01,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141226782] [2024-10-24 14:43:01,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141226782] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:43:01,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918172281] [2024-10-24 14:43:01,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 14:43:01,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:43:01,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:43:01,582 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-10-24 14:43:01,583 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-10-24 14:43:02,329 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 14:43:02,329 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 14:43:02,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 14:43:02,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:43:02,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 14:43:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3425 trivial. 0 not checked. [2024-10-24 14:43:03,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 14:43:03,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918172281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:43:03,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 14:43:03,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [20] total 27 [2024-10-24 14:43:03,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065190499] [2024-10-24 14:43:03,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:43:03,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 14:43:03,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:43:03,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 14:43:03,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-10-24 14:43:03,082 INFO L87 Difference]: Start difference. First operand 1863 states and 2500 transitions. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:43:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:43:03,903 INFO L93 Difference]: Finished difference Result 2447 states and 3283 transitions. [2024-10-24 14:43:03,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 14:43:03,904 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 846 [2024-10-24 14:43:03,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:43:03,913 INFO L225 Difference]: With dead ends: 2447 [2024-10-24 14:43:03,913 INFO L226 Difference]: Without dead ends: 2043 [2024-10-24 14:43:03,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 844 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 14:43:03,916 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 395 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 14:43:03,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 2255 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 14:43:03,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2024-10-24 14:43:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 1898. [2024-10-24 14:43:03,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1882 states have (on average 1.3363443145589797) internal successors, (2515), 1883 states have internal predecessors, (2515), 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-10-24 14:43:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2539 transitions. [2024-10-24 14:43:03,982 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2539 transitions. Word has length 846 [2024-10-24 14:43:03,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:43:03,983 INFO L471 AbstractCegarLoop]: Abstraction has 1898 states and 2539 transitions. [2024-10-24 14:43:03,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:43:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2539 transitions. [2024-10-24 14:43:04,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2024-10-24 14:43:04,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:43:04,005 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:43:04,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 14:43:04,205 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-10-24 14:43:04,207 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:43:04,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:43:04,208 INFO L85 PathProgramCache]: Analyzing trace with hash 269191322, now seen corresponding path program 1 times [2024-10-24 14:43:04,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:43:04,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890725447] [2024-10-24 14:43:04,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:43:04,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:43:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:43:14,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:43:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:43:14,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 14:43:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:43:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:43:14,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:43:14,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890725447] [2024-10-24 14:43:14,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890725447] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:43:14,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137757604] [2024-10-24 14:43:14,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:43:14,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:43:14,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:43:14,389 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-10-24 14:43:14,390 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-10-24 14:43:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:43:15,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 4159 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-24 14:43:15,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:43:15,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 14:43:15,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:43:16,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:43:16,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:43:16,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:43:16,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:43:16,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:43:16,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:43:16,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:43:16,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-10-24 14:43:16,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:43:16,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-24 14:43:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:43:16,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 14:43:17,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:43:17,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137757604] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 14:43:17,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 14:43:17,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 33 [2024-10-24 14:43:17,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545322620] [2024-10-24 14:43:17,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 14:43:17,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-24 14:43:17,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:43:17,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-24 14:43:17,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=643, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 14:43:17,883 INFO L87 Difference]: Start difference. First operand 1898 states and 2539 transitions. Second operand has 33 states, 33 states have (on average 49.121212121212125) internal successors, (1621), 32 states have internal predecessors, (1621), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 14:43:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:43:20,033 INFO L93 Difference]: Finished difference Result 12829 states and 17366 transitions. [2024-10-24 14:43:20,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-24 14:43:20,034 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 49.121212121212125) internal successors, (1621), 32 states have internal predecessors, (1621), 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 847 [2024-10-24 14:43:20,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:43:20,078 INFO L225 Difference]: With dead ends: 12829 [2024-10-24 14:43:20,078 INFO L226 Difference]: Without dead ends: 12387 [2024-10-24 14:43:20,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1736 GetRequests, 1683 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=878, Invalid=1774, Unknown=0, NotChecked=0, Total=2652 [2024-10-24 14:43:20,083 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 15448 mSDsluCounter, 10418 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15496 SdHoareTripleChecker+Valid, 10840 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 14:43:20,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15496 Valid, 10840 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 14:43:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12387 states. [2024-10-24 14:43:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12387 to 3626. [2024-10-24 14:43:20,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3626 states, 3598 states have (on average 1.3360200111172873) internal successors, (4807), 3599 states have internal predecessors, (4807), 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-10-24 14:43:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 4855 transitions. [2024-10-24 14:43:20,261 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 4855 transitions. Word has length 847 [2024-10-24 14:43:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:43:20,263 INFO L471 AbstractCegarLoop]: Abstraction has 3626 states and 4855 transitions. [2024-10-24 14:43:20,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 49.121212121212125) internal successors, (1621), 32 states have internal predecessors, (1621), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 14:43:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 4855 transitions. [2024-10-24 14:43:20,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1760 [2024-10-24 14:43:20,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:43:20,287 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:43:20,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 14:43:20,487 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-10-24 14:43:20,488 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:43:20,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:43:20,489 INFO L85 PathProgramCache]: Analyzing trace with hash 922343166, now seen corresponding path program 2 times [2024-10-24 14:43:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:43:20,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939398559] [2024-10-24 14:43:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:43:20,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:43:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat