./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_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:23:09,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:23:09,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 16:23:09,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:23:09,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:23:09,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:23:09,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:23:09,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:23:09,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:23:09,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:23:09,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:23:09,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:23:09,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:23:09,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:23:09,976 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:23:09,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:23:09,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:23:09,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:23:09,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:23:09,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:23:09,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:23:09,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:23:09,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:23:09,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:23:09,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:23:09,983 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:23:09,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:23:09,984 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:23:09,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:23:09,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:23:09,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:23:09,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:23:09,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:23:09,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:23:09,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:23:09,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:23:09,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:23:09,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:23:09,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:23:09,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:23:09,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:23:09,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:23:09,989 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 [2024-10-11 16:23:10,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:23:10,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:23:10,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:23:10,306 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:23:10,306 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:23:10,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2024-10-11 16:23:11,808 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:23:12,130 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:23:12,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2024-10-11 16:23:12,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/827968f19/43ce6ed54faa450bbe191932ee5c1dac/FLAGf5def46d9 [2024-10-11 16:23:12,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/827968f19/43ce6ed54faa450bbe191932ee5c1dac [2024-10-11 16:23:12,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:23:12,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:23:12,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:23:12,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:23:12,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:23:12,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:23:12" (1/1) ... [2024-10-11 16:23:12,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55dd7741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:12, skipping insertion in model container [2024-10-11 16:23:12,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:23:12" (1/1) ... [2024-10-11 16:23:12,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:23:12,985 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_test10-3.i[33022,33035] [2024-10-11 16:23:13,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:23:13,228 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:23:13,255 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_test10-3.i[33022,33035] [2024-10-11 16:23:13,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:23:13,411 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:23:13,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:13 WrapperNode [2024-10-11 16:23:13,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:23:13,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:23:13,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:23:13,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:23:13,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:13" (1/1) ... [2024-10-11 16:23:13,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:13" (1/1) ... [2024-10-11 16:23:13,704 INFO L138 Inliner]: procedures = 177, calls = 605, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3725 [2024-10-11 16:23:13,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:23:13,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:23:13,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:23:13,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:23:13,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:13" (1/1) ... [2024-10-11 16:23:13,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:13" (1/1) ... [2024-10-11 16:23:13,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:13" (1/1) ... [2024-10-11 16:23:13,921 INFO L175 MemorySlicer]: Split 574 memory accesses to 3 slices as follows [2, 466, 106]. 81 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 102 writes are split as follows [0, 98, 4]. [2024-10-11 16:23:13,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:13" (1/1) ... [2024-10-11 16:23:13,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:13" (1/1) ... [2024-10-11 16:23:13,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:13" (1/1) ... [2024-10-11 16:23:14,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:13" (1/1) ... [2024-10-11 16:23:14,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:13" (1/1) ... [2024-10-11 16:23:14,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:13" (1/1) ... [2024-10-11 16:23:14,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:23:14,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:23:14,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:23:14,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:23:14,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:13" (1/1) ... [2024-10-11 16:23:14,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:23:14,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:23:14,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:23:14,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:23:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-10-11 16:23:14,199 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-10-11 16:23:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:23:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:23:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:23:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 16:23:14,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 16:23:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:23:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:23:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:23:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:23:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:23:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:23:14,200 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:23:14,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:23:14,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:23:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:23:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:23:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:23:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:23:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:23:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:23:14,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:23:14,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:23:14,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:23:14,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:23:14,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:23:14,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:23:14,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:23:14,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:23:14,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:23:14,493 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:23:14,496 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:23:17,456 INFO L? ?]: Removed 823 outVars from TransFormulas that were not future-live. [2024-10-11 16:23:17,456 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:23:17,534 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:23:17,534 INFO L314 CfgBuilder]: Removed 168 assume(true) statements. [2024-10-11 16:23:17,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:23:17 BoogieIcfgContainer [2024-10-11 16:23:17,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:23:17,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:23:17,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:23:17,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:23:17,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:23:12" (1/3) ... [2024-10-11 16:23:17,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ac3e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:23:17, skipping insertion in model container [2024-10-11 16:23:17,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:13" (2/3) ... [2024-10-11 16:23:17,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ac3e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:23:17, skipping insertion in model container [2024-10-11 16:23:17,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:23:17" (3/3) ... [2024-10-11 16:23:17,543 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test10-3.i [2024-10-11 16:23:17,560 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:23:17,560 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 16:23:17,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:23:17,668 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;@74df353e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:23:17,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 16:23:17,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 1086 states, 1067 states have (on average 1.6326148078725398) internal successors, (1742), 1072 states have internal predecessors, (1742), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 16:23:17,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 16:23:17,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:23:17,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:23:17,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:23:17,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:23:17,693 INFO L85 PathProgramCache]: Analyzing trace with hash 599259722, now seen corresponding path program 1 times [2024-10-11 16:23:17,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:23:17,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550602076] [2024-10-11 16:23:17,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:17,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:23:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:23:17,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:23:17,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550602076] [2024-10-11 16:23:17,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550602076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:23:17,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:23:17,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:23:17,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354188351] [2024-10-11 16:23:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:23:17,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:23:17,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:23:17,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:23:17,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:23:17,963 INFO L87 Difference]: Start difference. First operand has 1086 states, 1067 states have (on average 1.6326148078725398) internal successors, (1742), 1072 states have internal predecessors, (1742), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:23:18,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:23:18,086 INFO L93 Difference]: Finished difference Result 2171 states and 3547 transitions. [2024-10-11 16:23:18,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:23:18,089 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 16:23:18,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:23:18,110 INFO L225 Difference]: With dead ends: 2171 [2024-10-11 16:23:18,110 INFO L226 Difference]: Without dead ends: 1023 [2024-10-11 16:23:18,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:23:18,124 INFO L432 NwaCegarLoop]: 1589 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:23:18,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1589 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:23:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2024-10-11 16:23:18,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1023. [2024-10-11 16:23:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1005 states have (on average 1.4736318407960198) internal successors, (1481), 1010 states have internal predecessors, (1481), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 16:23:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1508 transitions. [2024-10-11 16:23:18,222 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1508 transitions. Word has length 12 [2024-10-11 16:23:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:23:18,223 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1508 transitions. [2024-10-11 16:23:18,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:23:18,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1508 transitions. [2024-10-11 16:23:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 16:23:18,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:23:18,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:23:18,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:23:18,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:23:18,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:23:18,231 INFO L85 PathProgramCache]: Analyzing trace with hash 911090950, now seen corresponding path program 1 times [2024-10-11 16:23:18,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:23:18,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103923860] [2024-10-11 16:23:18,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:18,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:23:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:23:18,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:23:18,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103923860] [2024-10-11 16:23:18,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103923860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:23:18,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:23:18,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:23:18,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624888068] [2024-10-11 16:23:18,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:23:18,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:23:18,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:23:18,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:23:18,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:23:18,712 INFO L87 Difference]: Start difference. First operand 1023 states and 1508 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:23:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:23:18,936 INFO L93 Difference]: Finished difference Result 2042 states and 3012 transitions. [2024-10-11 16:23:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:23:18,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-11 16:23:18,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:23:18,947 INFO L225 Difference]: With dead ends: 2042 [2024-10-11 16:23:18,947 INFO L226 Difference]: Without dead ends: 1409 [2024-10-11 16:23:18,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:23:18,953 INFO L432 NwaCegarLoop]: 1587 mSDtfsCounter, 548 mSDsluCounter, 3024 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 4611 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:23:18,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 4611 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:23:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-10-11 16:23:19,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1025. [2024-10-11 16:23:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1007 states have (on average 1.4726911618669314) internal successors, (1483), 1012 states have internal predecessors, (1483), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 16:23:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1510 transitions. [2024-10-11 16:23:19,034 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1510 transitions. Word has length 67 [2024-10-11 16:23:19,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:23:19,034 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1510 transitions. [2024-10-11 16:23:19,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:23:19,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1510 transitions. [2024-10-11 16:23:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 16:23:19,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:23:19,044 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:23:19,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:23:19,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:23:19,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:23:19,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2132763725, now seen corresponding path program 1 times [2024-10-11 16:23:19,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:23:19,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837744324] [2024-10-11 16:23:19,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:19,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:23:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:23:19,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:23:19,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837744324] [2024-10-11 16:23:19,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837744324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:23:19,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:23:19,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:23:19,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601006620] [2024-10-11 16:23:19,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:23:19,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:23:19,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:23:19,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:23:19,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:23:19,634 INFO L87 Difference]: Start difference. First operand 1025 states and 1510 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:23:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:23:19,851 INFO L93 Difference]: Finished difference Result 2431 states and 3576 transitions. [2024-10-11 16:23:19,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:23:19,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2024-10-11 16:23:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:23:19,858 INFO L225 Difference]: With dead ends: 2431 [2024-10-11 16:23:19,858 INFO L226 Difference]: Without dead ends: 1409 [2024-10-11 16:23:19,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:23:19,861 INFO L432 NwaCegarLoop]: 1548 mSDtfsCounter, 544 mSDsluCounter, 2985 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 4533 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:23:19,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 4533 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:23:19,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-10-11 16:23:19,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1028. [2024-10-11 16:23:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1010 states have (on average 1.4712871287128713) internal successors, (1486), 1015 states have internal predecessors, (1486), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 16:23:19,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1513 transitions. [2024-10-11 16:23:19,896 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1513 transitions. Word has length 144 [2024-10-11 16:23:19,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:23:19,896 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1513 transitions. [2024-10-11 16:23:19,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:23:19,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1513 transitions. [2024-10-11 16:23:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 16:23:19,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:23:19,901 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:23:19,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:23:19,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:23:19,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:23:19,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1900156445, now seen corresponding path program 1 times [2024-10-11 16:23:19,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:23:19,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254723782] [2024-10-11 16:23:19,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:19,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:23:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:20,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:23:20,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:23:20,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254723782] [2024-10-11 16:23:20,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254723782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:23:20,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:23:20,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:23:20,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538112845] [2024-10-11 16:23:20,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:23:20,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:23:20,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:23:20,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:23:20,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:23:20,301 INFO L87 Difference]: Start difference. First operand 1028 states and 1513 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:23:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:23:20,416 INFO L93 Difference]: Finished difference Result 2008 states and 2954 transitions. [2024-10-11 16:23:20,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:23:20,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2024-10-11 16:23:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:23:20,422 INFO L225 Difference]: With dead ends: 2008 [2024-10-11 16:23:20,422 INFO L226 Difference]: Without dead ends: 986 [2024-10-11 16:23:20,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:23:20,427 INFO L432 NwaCegarLoop]: 1403 mSDtfsCounter, 30 mSDsluCounter, 2789 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4192 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:23:20,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4192 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:23:20,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2024-10-11 16:23:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2024-10-11 16:23:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 968 states have (on average 1.4555785123966942) internal successors, (1409), 973 states have internal predecessors, (1409), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 16:23:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1436 transitions. [2024-10-11 16:23:20,452 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1436 transitions. Word has length 215 [2024-10-11 16:23:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:23:20,453 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1436 transitions. [2024-10-11 16:23:20,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:23:20,453 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1436 transitions. [2024-10-11 16:23:20,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 16:23:20,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:23:20,456 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:23:20,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:23:20,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:23:20,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:23:20,457 INFO L85 PathProgramCache]: Analyzing trace with hash -648922665, now seen corresponding path program 1 times [2024-10-11 16:23:20,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:23:20,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816735864] [2024-10-11 16:23:20,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:20,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:23:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:23:20,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:23:20,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816735864] [2024-10-11 16:23:20,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816735864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:23:20,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:23:20,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:23:20,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115288568] [2024-10-11 16:23:20,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:23:20,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:23:20,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:23:20,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:23:20,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:23:20,710 INFO L87 Difference]: Start difference. First operand 986 states and 1436 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:23:20,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:23:20,820 INFO L93 Difference]: Finished difference Result 2497 states and 3649 transitions. [2024-10-11 16:23:20,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:23:20,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2024-10-11 16:23:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:23:20,828 INFO L225 Difference]: With dead ends: 2497 [2024-10-11 16:23:20,828 INFO L226 Difference]: Without dead ends: 1517 [2024-10-11 16:23:20,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:23:20,832 INFO L432 NwaCegarLoop]: 1420 mSDtfsCounter, 716 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 2823 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:23:20,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 2823 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:23:20,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-10-11 16:23:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1358. [2024-10-11 16:23:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1338 states have (on average 1.4581464872944694) internal successors, (1951), 1343 states have internal predecessors, (1951), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:23:20,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1982 transitions. [2024-10-11 16:23:20,873 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1982 transitions. Word has length 215 [2024-10-11 16:23:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:23:20,874 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1982 transitions. [2024-10-11 16:23:20,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:23:20,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1982 transitions. [2024-10-11 16:23:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 16:23:20,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:23:20,879 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:23:20,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:23:20,880 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:23:20,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:23:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash -499466754, now seen corresponding path program 1 times [2024-10-11 16:23:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:23:20,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179050631] [2024-10-11 16:23:20,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:20,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:23:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:21,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:23:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:21,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:23:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:23:21,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:23:21,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179050631] [2024-10-11 16:23:21,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179050631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:23:21,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:23:21,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:23:21,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76918605] [2024-10-11 16:23:21,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:23:21,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:23:21,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:23:21,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:23:21,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:23:21,424 INFO L87 Difference]: Start difference. First operand 1358 states and 1982 transitions. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 4 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:23:21,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:23:21,962 INFO L93 Difference]: Finished difference Result 2585 states and 3784 transitions. [2024-10-11 16:23:21,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:23:21,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 4 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2024-10-11 16:23:21,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:23:21,970 INFO L225 Difference]: With dead ends: 2585 [2024-10-11 16:23:21,970 INFO L226 Difference]: Without dead ends: 1318 [2024-10-11 16:23:21,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:23:21,973 INFO L432 NwaCegarLoop]: 1297 mSDtfsCounter, 51 mSDsluCounter, 3741 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 5038 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:23:21,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 5038 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:23:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-10-11 16:23:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2024-10-11 16:23:22,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1296 states have (on average 1.4459876543209877) internal successors, (1874), 1301 states have internal predecessors, (1874), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:23:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1905 transitions. [2024-10-11 16:23:22,011 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1905 transitions. Word has length 228 [2024-10-11 16:23:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:23:22,013 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1905 transitions. [2024-10-11 16:23:22,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 4 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:23:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1905 transitions. [2024-10-11 16:23:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 16:23:22,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:23:22,017 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:23:22,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:23:22,017 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:23:22,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:23:22,017 INFO L85 PathProgramCache]: Analyzing trace with hash -875273718, now seen corresponding path program 1 times [2024-10-11 16:23:22,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:23:22,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696291042] [2024-10-11 16:23:22,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:22,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:23:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:22,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:23:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:22,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:23:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:23:22,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:23:22,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696291042] [2024-10-11 16:23:22,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696291042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:23:22,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:23:22,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:23:22,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959412880] [2024-10-11 16:23:22,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:23:22,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:23:22,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:23:22,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:23:22,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:23:22,407 INFO L87 Difference]: Start difference. First operand 1316 states and 1905 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:23:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:23:23,081 INFO L93 Difference]: Finished difference Result 2543 states and 3696 transitions. [2024-10-11 16:23:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:23:23,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2024-10-11 16:23:23,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:23:23,089 INFO L225 Difference]: With dead ends: 2543 [2024-10-11 16:23:23,090 INFO L226 Difference]: Without dead ends: 1318 [2024-10-11 16:23:23,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:23:23,095 INFO L432 NwaCegarLoop]: 1310 mSDtfsCounter, 22 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3782 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:23:23,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3782 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:23:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-10-11 16:23:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2024-10-11 16:23:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1296 states have (on average 1.4436728395061729) internal successors, (1871), 1301 states have internal predecessors, (1871), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:23:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1902 transitions. [2024-10-11 16:23:23,134 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1902 transitions. Word has length 228 [2024-10-11 16:23:23,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:23:23,136 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1902 transitions. [2024-10-11 16:23:23,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:23:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1902 transitions. [2024-10-11 16:23:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 16:23:23,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:23:23,139 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:23:23,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:23:23,140 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:23:23,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:23:23,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1692548616, now seen corresponding path program 1 times [2024-10-11 16:23:23,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:23:23,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143540600] [2024-10-11 16:23:23,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:23,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:23:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:23,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:23:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:23,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:23:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:23:23,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:23:23,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143540600] [2024-10-11 16:23:23,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143540600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:23:23,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:23:23,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:23:23,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329062255] [2024-10-11 16:23:23,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:23:23,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:23:23,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:23:23,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:23:23,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:23:23,460 INFO L87 Difference]: Start difference. First operand 1316 states and 1902 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:23:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:23:24,018 INFO L93 Difference]: Finished difference Result 3114 states and 4524 transitions. [2024-10-11 16:23:24,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:23:24,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2024-10-11 16:23:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:23:24,030 INFO L225 Difference]: With dead ends: 3114 [2024-10-11 16:23:24,034 INFO L226 Difference]: Without dead ends: 1889 [2024-10-11 16:23:24,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:23:24,040 INFO L432 NwaCegarLoop]: 1314 mSDtfsCounter, 618 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 3796 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:23:24,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 3796 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:23:24,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2024-10-11 16:23:24,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1882. [2024-10-11 16:23:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1856 states have (on average 1.4455818965517242) internal successors, (2683), 1861 states have internal predecessors, (2683), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 16:23:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2726 transitions. [2024-10-11 16:23:24,110 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2726 transitions. Word has length 228 [2024-10-11 16:23:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:23:24,113 INFO L471 AbstractCegarLoop]: Abstraction has 1882 states and 2726 transitions. [2024-10-11 16:23:24,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:23:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2726 transitions. [2024-10-11 16:23:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-11 16:23:24,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:23:24,119 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:23:24,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 16:23:24,120 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:23:24,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:23:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1864865738, now seen corresponding path program 1 times [2024-10-11 16:23:24,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:23:24,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924980494] [2024-10-11 16:23:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:24,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:23:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:24,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:23:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:24,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:23:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:24,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:23:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:24,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:23:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:23:24,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:23:24,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924980494] [2024-10-11 16:23:24,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924980494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:23:24,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:23:24,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:23:24,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509900882] [2024-10-11 16:23:24,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:23:24,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:23:24,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:23:24,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:23:24,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:23:24,594 INFO L87 Difference]: Start difference. First operand 1882 states and 2726 transitions. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 5 states have internal predecessors, (225), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:23:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:23:25,709 INFO L93 Difference]: Finished difference Result 4067 states and 5941 transitions. [2024-10-11 16:23:25,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:23:25,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 5 states have internal predecessors, (225), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 241 [2024-10-11 16:23:25,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:23:25,720 INFO L225 Difference]: With dead ends: 4067 [2024-10-11 16:23:25,720 INFO L226 Difference]: Without dead ends: 2422 [2024-10-11 16:23:25,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:23:25,724 INFO L432 NwaCegarLoop]: 1354 mSDtfsCounter, 3558 mSDsluCounter, 2766 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3569 SdHoareTripleChecker+Valid, 4120 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:23:25,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3569 Valid, 4120 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 16:23:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2024-10-11 16:23:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 1453. [2024-10-11 16:23:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1432 states have (on average 1.4301675977653632) internal successors, (2048), 1437 states have internal predecessors, (2048), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:23:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2081 transitions. [2024-10-11 16:23:25,780 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2081 transitions. Word has length 241 [2024-10-11 16:23:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:23:25,780 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 2081 transitions. [2024-10-11 16:23:25,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 5 states have internal predecessors, (225), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:23:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2081 transitions. [2024-10-11 16:23:25,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-11 16:23:25,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:23:25,784 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:23:25,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 16:23:25,785 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:23:25,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:23:25,785 INFO L85 PathProgramCache]: Analyzing trace with hash -244071330, now seen corresponding path program 1 times [2024-10-11 16:23:25,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:23:25,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128475374] [2024-10-11 16:23:25,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:25,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:23:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:26,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:23:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:26,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:23:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:26,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:23:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:26,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:23:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 16:23:26,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:23:26,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128475374] [2024-10-11 16:23:26,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128475374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:23:26,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:23:26,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:23:26,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881499163] [2024-10-11 16:23:26,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:23:26,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:23:26,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:23:26,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:23:26,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:23:26,157 INFO L87 Difference]: Start difference. First operand 1453 states and 2081 transitions. Second operand has 5 states, 5 states have (on average 46.8) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:23:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:23:26,750 INFO L93 Difference]: Finished difference Result 2323 states and 3378 transitions. [2024-10-11 16:23:26,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:23:26,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 251 [2024-10-11 16:23:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:23:26,760 INFO L225 Difference]: With dead ends: 2323 [2024-10-11 16:23:26,760 INFO L226 Difference]: Without dead ends: 1458 [2024-10-11 16:23:26,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:23:26,763 INFO L432 NwaCegarLoop]: 1286 mSDtfsCounter, 126 mSDsluCounter, 3634 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 4920 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:23:26,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 4920 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:23:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2024-10-11 16:23:26,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1453. [2024-10-11 16:23:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1432 states have (on average 1.4252793296089385) internal successors, (2041), 1437 states have internal predecessors, (2041), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:23:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2074 transitions. [2024-10-11 16:23:26,832 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2074 transitions. Word has length 251 [2024-10-11 16:23:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:23:26,833 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 2074 transitions. [2024-10-11 16:23:26,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:23:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2074 transitions. [2024-10-11 16:23:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-11 16:23:26,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:23:26,836 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:23:26,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 16:23:26,837 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:23:26,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:23:26,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1333401426, now seen corresponding path program 1 times [2024-10-11 16:23:26,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:23:26,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003048615] [2024-10-11 16:23:26,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:26,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:23:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:27,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:23:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:27,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:23:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:27,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:23:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:27,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:23:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 16:23:27,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:23:27,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003048615] [2024-10-11 16:23:27,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003048615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:23:27,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:23:27,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:23:27,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139043119] [2024-10-11 16:23:27,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:23:27,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:23:27,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:23:27,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:23:27,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:23:27,192 INFO L87 Difference]: Start difference. First operand 1453 states and 2074 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:23:27,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:23:27,699 INFO L93 Difference]: Finished difference Result 2310 states and 3353 transitions. [2024-10-11 16:23:27,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:23:27,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 251 [2024-10-11 16:23:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:23:27,707 INFO L225 Difference]: With dead ends: 2310 [2024-10-11 16:23:27,707 INFO L226 Difference]: Without dead ends: 1461 [2024-10-11 16:23:27,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:23:27,711 INFO L432 NwaCegarLoop]: 1301 mSDtfsCounter, 22 mSDsluCounter, 2451 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3752 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:23:27,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3752 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:23:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2024-10-11 16:23:27,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1459. [2024-10-11 16:23:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1438 states have (on average 1.4235048678720446) internal successors, (2047), 1443 states have internal predecessors, (2047), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:23:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2080 transitions. [2024-10-11 16:23:27,755 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2080 transitions. Word has length 251 [2024-10-11 16:23:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:23:27,756 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 2080 transitions. [2024-10-11 16:23:27,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:23:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2080 transitions. [2024-10-11 16:23:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-11 16:23:27,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:23:27,759 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:23:27,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 16:23:27,760 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:23:27,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:23:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1814481684, now seen corresponding path program 1 times [2024-10-11 16:23:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:23:27,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875866841] [2024-10-11 16:23:27,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:27,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:23:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:28,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:23:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:28,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:23:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:29,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:23:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:29,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:23:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:23:29,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:23:29,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875866841] [2024-10-11 16:23:29,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875866841] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:23:29,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026457931] [2024-10-11 16:23:29,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:29,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:23:29,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:23:29,013 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:23:29,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 16:23:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:29,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 16:23:29,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:23:29,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:23:30,145 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 19 treesize of output 11 [2024-10-11 16:23:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:23:30,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:23:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:23:30,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026457931] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:23:30,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:23:30,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2024-10-11 16:23:30,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230191138] [2024-10-11 16:23:30,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:23:30,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 16:23:30,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:23:30,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 16:23:30,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:23:30,497 INFO L87 Difference]: Start difference. First operand 1459 states and 2080 transitions. Second operand has 13 states, 13 states have (on average 42.92307692307692) internal successors, (558), 12 states have internal predecessors, (558), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:23:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:23:31,687 INFO L93 Difference]: Finished difference Result 3333 states and 4738 transitions. [2024-10-11 16:23:31,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 16:23:31,688 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 42.92307692307692) internal successors, (558), 12 states have internal predecessors, (558), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 251 [2024-10-11 16:23:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:23:31,698 INFO L225 Difference]: With dead ends: 3333 [2024-10-11 16:23:31,698 INFO L226 Difference]: Without dead ends: 2407 [2024-10-11 16:23:31,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 497 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 16:23:31,702 INFO L432 NwaCegarLoop]: 1619 mSDtfsCounter, 4078 mSDsluCounter, 8630 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4109 SdHoareTripleChecker+Valid, 10249 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:23:31,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4109 Valid, 10249 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 16:23:31,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2024-10-11 16:23:31,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 2112. [2024-10-11 16:23:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 2079 states have (on average 1.392977392977393) internal successors, (2896), 2084 states have internal predecessors, (2896), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 16:23:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2951 transitions. [2024-10-11 16:23:31,770 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2951 transitions. Word has length 251 [2024-10-11 16:23:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:23:31,771 INFO L471 AbstractCegarLoop]: Abstraction has 2112 states and 2951 transitions. [2024-10-11 16:23:31,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 42.92307692307692) internal successors, (558), 12 states have internal predecessors, (558), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:23:31,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2951 transitions. [2024-10-11 16:23:31,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2024-10-11 16:23:31,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:23:31,780 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, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:23:31,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 16:23:31,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 16:23:31,982 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:23:31,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:23:31,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2082889347, now seen corresponding path program 1 times [2024-10-11 16:23:31,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:23:31,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190274024] [2024-10-11 16:23:31,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:31,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:23:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:34,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:23:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:34,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:23:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:34,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:23:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:34,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:23:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 234 proven. 5 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-11 16:23:34,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:23:34,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190274024] [2024-10-11 16:23:34,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190274024] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:23:34,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609768198] [2024-10-11 16:23:34,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:34,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:23:34,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:23:34,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:23:34,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 16:23:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:35,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 2403 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 16:23:35,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:23:35,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:23:35,853 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 19 treesize of output 11 [2024-10-11 16:23:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 234 proven. 5 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-11 16:23:35,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:23:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 234 proven. 5 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-11 16:23:36,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609768198] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:23:36,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:23:36,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-10-11 16:23:36,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580146305] [2024-10-11 16:23:36,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:23:36,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 16:23:36,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:23:36,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 16:23:36,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:23:36,165 INFO L87 Difference]: Start difference. First operand 2112 states and 2951 transitions. Second operand has 14 states, 14 states have (on average 46.07142857142857) internal successors, (645), 13 states have internal predecessors, (645), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:23:37,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:23:37,357 INFO L93 Difference]: Finished difference Result 4073 states and 5723 transitions. [2024-10-11 16:23:37,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 16:23:37,358 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 46.07142857142857) internal successors, (645), 13 states have internal predecessors, (645), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 482 [2024-10-11 16:23:37,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:23:37,368 INFO L225 Difference]: With dead ends: 4073 [2024-10-11 16:23:37,368 INFO L226 Difference]: Without dead ends: 2407 [2024-10-11 16:23:37,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 960 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-10-11 16:23:37,372 INFO L432 NwaCegarLoop]: 1645 mSDtfsCounter, 2606 mSDsluCounter, 11722 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2636 SdHoareTripleChecker+Valid, 13367 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:23:37,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2636 Valid, 13367 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 16:23:37,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2024-10-11 16:23:37,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 2115. [2024-10-11 16:23:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2115 states, 2082 states have (on average 1.3914505283381364) internal successors, (2897), 2087 states have internal predecessors, (2897), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 16:23:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2952 transitions. [2024-10-11 16:23:37,448 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2952 transitions. Word has length 482 [2024-10-11 16:23:37,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:23:37,453 INFO L471 AbstractCegarLoop]: Abstraction has 2115 states and 2952 transitions. [2024-10-11 16:23:37,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 46.07142857142857) internal successors, (645), 13 states have internal predecessors, (645), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:23:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2952 transitions. [2024-10-11 16:23:37,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2024-10-11 16:23:37,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:23:37,469 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, 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, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:23:37,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 16:23:37,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:23:37,670 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:23:37,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:23:37,671 INFO L85 PathProgramCache]: Analyzing trace with hash 436848613, now seen corresponding path program 1 times [2024-10-11 16:23:37,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:23:37,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422967525] [2024-10-11 16:23:37,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:37,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:23:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:43,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:23:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:43,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:23:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:43,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:23:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:43,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:23:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 884 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:23:43,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:23:43,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422967525] [2024-10-11 16:23:43,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422967525] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:23:43,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686115256] [2024-10-11 16:23:43,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:43,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:23:43,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:23:43,800 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:23:43,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 16:23:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:44,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 3384 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 16:23:45,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:23:45,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:23:45,307 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 19 treesize of output 11 [2024-10-11 16:23:45,489 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 19 treesize of output 11 [2024-10-11 16:23:45,688 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 19 treesize of output 11 [2024-10-11 16:23:45,911 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 19 treesize of output 11 [2024-10-11 16:23:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 884 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:23:45,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:23:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 884 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:23:46,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686115256] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:23:46,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:23:46,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 25 [2024-10-11 16:23:46,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923456175] [2024-10-11 16:23:46,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:23:46,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 16:23:46,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:23:46,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 16:23:46,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2024-10-11 16:23:46,809 INFO L87 Difference]: Start difference. First operand 2115 states and 2952 transitions. Second operand has 25 states, 25 states have (on average 75.6) internal successors, (1890), 24 states have internal predecessors, (1890), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:23:49,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:23:49,018 INFO L93 Difference]: Finished difference Result 5091 states and 7114 transitions. [2024-10-11 16:23:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 16:23:49,019 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 75.6) internal successors, (1890), 24 states have internal predecessors, (1890), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 695 [2024-10-11 16:23:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:23:49,043 INFO L225 Difference]: With dead ends: 5091 [2024-10-11 16:23:49,044 INFO L226 Difference]: Without dead ends: 4165 [2024-10-11 16:23:49,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1422 GetRequests, 1382 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=324, Invalid=866, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 16:23:49,049 INFO L432 NwaCegarLoop]: 2753 mSDtfsCounter, 6145 mSDsluCounter, 24687 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6224 SdHoareTripleChecker+Valid, 27440 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:23:49,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6224 Valid, 27440 Invalid, 1674 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [99 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 16:23:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4165 states. [2024-10-11 16:23:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4165 to 3870. [2024-10-11 16:23:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3870 states, 3813 states have (on average 1.3629687909782324) internal successors, (5197), 3818 states have internal predecessors, (5197), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 16:23:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 5300 transitions. [2024-10-11 16:23:49,162 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 5300 transitions. Word has length 695 [2024-10-11 16:23:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:23:49,163 INFO L471 AbstractCegarLoop]: Abstraction has 3870 states and 5300 transitions. [2024-10-11 16:23:49,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 75.6) internal successors, (1890), 24 states have internal predecessors, (1890), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:23:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 5300 transitions. [2024-10-11 16:23:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1158 [2024-10-11 16:23:49,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:23:49,180 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:23:49,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 16:23:49,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:23:49,381 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:23:49,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:23:49,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2085138949, now seen corresponding path program 1 times [2024-10-11 16:23:49,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:23:49,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659900490] [2024-10-11 16:23:49,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:49,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:23:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:57,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:23:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:57,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:23:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:57,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:23:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:57,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:23:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3905 backedges. 1851 proven. 896 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2024-10-11 16:23:57,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:23:57,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659900490] [2024-10-11 16:23:57,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659900490] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:23:57,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965960258] [2024-10-11 16:23:57,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:23:57,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:23:57,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:23:57,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:23:57,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 16:23:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:23:59,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 5664 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 16:23:59,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:23:59,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:23:59,686 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 19 treesize of output 11 [2024-10-11 16:23:59,870 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 19 treesize of output 11 [2024-10-11 16:24:00,069 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 19 treesize of output 11 [2024-10-11 16:24:00,223 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 19 treesize of output 11 [2024-10-11 16:24:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3905 backedges. 1851 proven. 896 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2024-10-11 16:24:00,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:24:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3905 backedges. 1851 proven. 896 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2024-10-11 16:24:00,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965960258] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:24:00,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:24:00,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 8] total 26 [2024-10-11 16:24:00,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277913338] [2024-10-11 16:24:00,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:24:00,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 16:24:00,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:24:00,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 16:24:00,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=462, Unknown=0, NotChecked=0, Total=650 [2024-10-11 16:24:00,947 INFO L87 Difference]: Start difference. First operand 3870 states and 5300 transitions. Second operand has 26 states, 26 states have (on average 76.03846153846153) internal successors, (1977), 25 states have internal predecessors, (1977), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:24:02,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:24:02,950 INFO L93 Difference]: Finished difference Result 6710 states and 9272 transitions. [2024-10-11 16:24:02,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-11 16:24:02,951 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 76.03846153846153) internal successors, (1977), 25 states have internal predecessors, (1977), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 1157 [2024-10-11 16:24:02,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:24:02,965 INFO L225 Difference]: With dead ends: 6710 [2024-10-11 16:24:02,965 INFO L226 Difference]: Without dead ends: 4165 [2024-10-11 16:24:02,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2353 GetRequests, 2307 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=375, Invalid=1265, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 16:24:02,972 INFO L432 NwaCegarLoop]: 2776 mSDtfsCounter, 5659 mSDsluCounter, 26990 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5737 SdHoareTripleChecker+Valid, 29766 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:24:02,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5737 Valid, 29766 Invalid, 1569 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [106 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 16:24:02,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4165 states. [2024-10-11 16:24:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4165 to 3873. [2024-10-11 16:24:03,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3873 states, 3816 states have (on average 1.3613731656184487) internal successors, (5195), 3821 states have internal predecessors, (5195), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 16:24:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 5298 transitions. [2024-10-11 16:24:03,164 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 5298 transitions. Word has length 1157 [2024-10-11 16:24:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:24:03,166 INFO L471 AbstractCegarLoop]: Abstraction has 3873 states and 5298 transitions. [2024-10-11 16:24:03,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 76.03846153846153) internal successors, (1977), 25 states have internal predecessors, (1977), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:24:03,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 5298 transitions. [2024-10-11 16:24:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1584 [2024-10-11 16:24:03,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:24:03,187 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 9, 9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:24:03,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 16:24:03,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 16:24:03,388 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:24:03,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:24:03,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1852803847, now seen corresponding path program 2 times [2024-10-11 16:24:03,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:24:03,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587147103] [2024-10-11 16:24:03,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:24:03,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:24:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:24:08,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:24:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:24:08,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:24:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:24:08,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:24:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:24:08,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:24:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:24:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6662 backedges. 1320 proven. 1 refuted. 0 times theorem prover too weak. 5341 trivial. 0 not checked. [2024-10-11 16:24:08,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:24:08,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587147103] [2024-10-11 16:24:08,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587147103] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:24:08,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668292319] [2024-10-11 16:24:08,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 16:24:08,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:24:08,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:24:08,275 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:24:08,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 16:24:09,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 16:24:09,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 16:24:09,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 16:24:09,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:24:09,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:24:10,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 16:24:10,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 58 [2024-10-11 16:24:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6662 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6662 trivial. 0 not checked. [2024-10-11 16:24:10,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:24:10,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668292319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:24:10,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:24:10,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2024-10-11 16:24:10,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081397025] [2024-10-11 16:24:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:24:10,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:24:10,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:24:10,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:24:10,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-11 16:24:10,547 INFO L87 Difference]: Start difference. First operand 3873 states and 5298 transitions. Second operand has 10 states, 10 states have (on average 24.0) internal successors, (240), 10 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:24:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:24:11,960 INFO L93 Difference]: Finished difference Result 4749 states and 6589 transitions. [2024-10-11 16:24:11,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:24:11,960 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 24.0) internal successors, (240), 10 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1583 [2024-10-11 16:24:11,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:24:11,972 INFO L225 Difference]: With dead ends: 4749 [2024-10-11 16:24:11,972 INFO L226 Difference]: Without dead ends: 3910 [2024-10-11 16:24:11,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1605 GetRequests, 1584 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-10-11 16:24:11,976 INFO L432 NwaCegarLoop]: 1305 mSDtfsCounter, 502 mSDsluCounter, 6582 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 7887 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:24:11,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 7887 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 16:24:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3910 states. [2024-10-11 16:24:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3910 to 3905. [2024-10-11 16:24:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3905 states, 3848 states have (on average 1.3596673596673596) internal successors, (5232), 3853 states have internal predecessors, (5232), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 16:24:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3905 states to 3905 states and 5335 transitions. [2024-10-11 16:24:12,072 INFO L78 Accepts]: Start accepts. Automaton has 3905 states and 5335 transitions. Word has length 1583 [2024-10-11 16:24:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:24:12,075 INFO L471 AbstractCegarLoop]: Abstraction has 3905 states and 5335 transitions. [2024-10-11 16:24:12,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.0) internal successors, (240), 10 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:24:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3905 states and 5335 transitions. [2024-10-11 16:24:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1584 [2024-10-11 16:24:12,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:24:12,095 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 9, 9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:24:12,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 16:24:12,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 16:24:12,296 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:24:12,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:24:12,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1430277375, now seen corresponding path program 1 times [2024-10-11 16:24:12,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:24:12,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593978236] [2024-10-11 16:24:12,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:24:12,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:24:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:24:14,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:24:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:24:14,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:24:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:24:14,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:24:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:24:14,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:24:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:24:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6662 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6662 trivial. 0 not checked. [2024-10-11 16:24:14,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:24:14,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593978236] [2024-10-11 16:24:14,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593978236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:24:14,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:24:14,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:24:14,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825892791] [2024-10-11 16:24:14,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:24:14,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:24:14,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:24:14,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:24:14,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:24:14,324 INFO L87 Difference]: Start difference. First operand 3905 states and 5335 transitions. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 4 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:24:14,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:24:14,880 INFO L93 Difference]: Finished difference Result 4758 states and 6639 transitions. [2024-10-11 16:24:14,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:24:14,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 4 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1583 [2024-10-11 16:24:14,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:24:14,893 INFO L225 Difference]: With dead ends: 4758 [2024-10-11 16:24:14,893 INFO L226 Difference]: Without dead ends: 3823 [2024-10-11 16:24:14,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:24:14,897 INFO L432 NwaCegarLoop]: 1210 mSDtfsCounter, 30 mSDsluCounter, 3480 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4690 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:24:14,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4690 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:24:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2024-10-11 16:24:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 3819. [2024-10-11 16:24:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3819 states, 3762 states have (on average 1.3577884104199893) internal successors, (5108), 3767 states have internal predecessors, (5108), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 16:24:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 5211 transitions. [2024-10-11 16:24:14,989 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 5211 transitions. Word has length 1583 [2024-10-11 16:24:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:24:14,992 INFO L471 AbstractCegarLoop]: Abstraction has 3819 states and 5211 transitions. [2024-10-11 16:24:14,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 4 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:24:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 5211 transitions. [2024-10-11 16:24:15,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1585 [2024-10-11 16:24:15,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:24:15,011 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 9, 9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:24:15,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 16:24:15,011 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:24:15,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:24:15,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1412933951, now seen corresponding path program 1 times [2024-10-11 16:24:15,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:24:15,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174065296] [2024-10-11 16:24:15,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:24:15,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:24:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat