./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:35:59,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:35:59,500 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:35:59,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:35:59,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:35:59,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:35:59,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:35:59,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:35:59,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:35:59,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:35:59,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:35:59,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:35:59,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:35:59,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:35:59,541 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:35:59,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:35:59,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:35:59,545 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:35:59,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:35:59,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:35:59,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:35:59,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:35:59,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:35:59,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:35:59,547 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:35:59,547 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:35:59,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:35:59,548 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:35:59,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:35:59,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:35:59,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:35:59,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:35:59,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:35:59,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:35:59,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:35:59,551 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:35:59,551 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:35:59,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:35:59,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:35:59,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:35:59,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:35:59,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:35:59,552 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-10-11 16:35:59,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:35:59,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:35:59,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:35:59,813 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:35:59,814 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:35:59,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2024-10-11 16:36:01,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:36:01,564 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:36:01,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2024-10-11 16:36:01,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/902b82fab/1da0fef9ff624214a971a1a8ee0c50f9/FLAGc1166867b [2024-10-11 16:36:01,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/902b82fab/1da0fef9ff624214a971a1a8ee0c50f9 [2024-10-11 16:36:01,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:36:01,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:36:01,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:36:01,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:36:01,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:36:01,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:36:01" (1/1) ... [2024-10-11 16:36:01,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca0c8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:01, skipping insertion in model container [2024-10-11 16:36:01,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:36:01" (1/1) ... [2024-10-11 16:36:01,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:36:02,381 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i[37435,37448] [2024-10-11 16:36:02,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:36:02,499 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:36:02,587 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i[37435,37448] [2024-10-11 16:36:02,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:36:02,713 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:36:02,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:02 WrapperNode [2024-10-11 16:36:02,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:36:02,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:36:02,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:36:02,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:36:02,720 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:36:02" (1/1) ... [2024-10-11 16:36:02,753 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:36:02" (1/1) ... [2024-10-11 16:36:02,818 INFO L138 Inliner]: procedures = 207, calls = 221, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1277 [2024-10-11 16:36:02,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:36:02,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:36:02,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:36:02,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:36:02,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:02" (1/1) ... [2024-10-11 16:36:02,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:02" (1/1) ... [2024-10-11 16:36:02,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:02" (1/1) ... [2024-10-11 16:36:02,904 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [34, 2, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 46 writes are split as follows [4, 0, 42]. [2024-10-11 16:36:02,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:02" (1/1) ... [2024-10-11 16:36:02,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:02" (1/1) ... [2024-10-11 16:36:02,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:02" (1/1) ... [2024-10-11 16:36:02,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:02" (1/1) ... [2024-10-11 16:36:02,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:02" (1/1) ... [2024-10-11 16:36:02,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:02" (1/1) ... [2024-10-11 16:36:02,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:36:02,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:36:02,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:36:02,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:36:02,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:02" (1/1) ... [2024-10-11 16:36:03,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:36:03,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:36:03,033 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:36:03,038 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:36:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:36:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:36:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:36:03,087 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:36:03,087 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:36:03,087 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:36:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:36:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:36:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:36:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:36:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:36:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:36:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:36:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:36:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:36:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:36:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:36:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:36:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:36:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:36:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:36:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:36:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:36:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:36:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:36:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:36:03,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:36:03,270 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:36:03,273 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:36:04,535 INFO L? ?]: Removed 294 outVars from TransFormulas that were not future-live. [2024-10-11 16:36:04,535 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:36:04,580 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:36:04,581 INFO L314 CfgBuilder]: Removed 54 assume(true) statements. [2024-10-11 16:36:04,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:36:04 BoogieIcfgContainer [2024-10-11 16:36:04,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:36:04,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:36:04,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:36:04,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:36:04,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:36:01" (1/3) ... [2024-10-11 16:36:04,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a4a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:36:04, skipping insertion in model container [2024-10-11 16:36:04,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:02" (2/3) ... [2024-10-11 16:36:04,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a4a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:36:04, skipping insertion in model container [2024-10-11 16:36:04,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:36:04" (3/3) ... [2024-10-11 16:36:04,591 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-1.i [2024-10-11 16:36:04,608 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:36:04,608 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 16:36:04,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:36:04,688 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;@44943495, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:36:04,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 16:36:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 356 states have (on average 1.6264044943820224) internal successors, (579), 357 states have internal predecessors, (579), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 16:36:04,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:04,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:04,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:04,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:04,711 INFO L85 PathProgramCache]: Analyzing trace with hash 685924647, now seen corresponding path program 1 times [2024-10-11 16:36:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:04,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311457876] [2024-10-11 16:36:04,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:04,937 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:36:04,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:04,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311457876] [2024-10-11 16:36:04,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311457876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:04,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:04,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:36:04,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787235560] [2024-10-11 16:36:04,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:04,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:36:04,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:04,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:36:04,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:36:04,973 INFO L87 Difference]: Start difference. First operand has 362 states, 356 states have (on average 1.6264044943820224) internal successors, (579), 357 states have internal predecessors, (579), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:36:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:05,058 INFO L93 Difference]: Finished difference Result 722 states and 1167 transitions. [2024-10-11 16:36:05,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:36:05,065 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 16:36:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:05,077 INFO L225 Difference]: With dead ends: 722 [2024-10-11 16:36:05,077 INFO L226 Difference]: Without dead ends: 359 [2024-10-11 16:36:05,083 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:36:05,088 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:05,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:36:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-11 16:36:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-11 16:36:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.4576271186440677) internal successors, (516), 354 states have internal predecessors, (516), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 522 transitions. [2024-10-11 16:36:05,168 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 522 transitions. Word has length 10 [2024-10-11 16:36:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:05,169 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 522 transitions. [2024-10-11 16:36:05,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:36:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2024-10-11 16:36:05,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 16:36:05,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:05,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:05,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:36:05,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:05,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:05,177 INFO L85 PathProgramCache]: Analyzing trace with hash -347738900, now seen corresponding path program 1 times [2024-10-11 16:36:05,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:05,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67013906] [2024-10-11 16:36:05,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:05,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:05,588 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:36:05,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:05,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67013906] [2024-10-11 16:36:05,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67013906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:05,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:05,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:36:05,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810379625] [2024-10-11 16:36:05,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:05,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:36:05,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:05,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:36:05,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:36:05,596 INFO L87 Difference]: Start difference. First operand 359 states and 522 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:36:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:05,718 INFO L93 Difference]: Finished difference Result 475 states and 689 transitions. [2024-10-11 16:36:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:36:05,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-11 16:36:05,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:05,723 INFO L225 Difference]: With dead ends: 475 [2024-10-11 16:36:05,724 INFO L226 Difference]: Without dead ends: 317 [2024-10-11 16:36:05,728 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:36:05,729 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 30 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1234 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:36:05,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1234 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:36:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-11 16:36:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-10-11 16:36:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 312 states have (on average 1.4070512820512822) internal successors, (439), 312 states have internal predecessors, (439), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 445 transitions. [2024-10-11 16:36:05,755 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 445 transitions. Word has length 65 [2024-10-11 16:36:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:05,755 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 445 transitions. [2024-10-11 16:36:05,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:36:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 445 transitions. [2024-10-11 16:36:05,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 16:36:05,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:05,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:05,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:36:05,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:05,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1528203272, now seen corresponding path program 1 times [2024-10-11 16:36:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:05,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108828770] [2024-10-11 16:36:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:05,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:06,322 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:36:06,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:06,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108828770] [2024-10-11 16:36:06,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108828770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:06,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:06,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:36:06,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721617668] [2024-10-11 16:36:06,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:06,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:36:06,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:06,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:36:06,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:36:06,329 INFO L87 Difference]: Start difference. First operand 317 states and 445 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:36:06,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:06,537 INFO L93 Difference]: Finished difference Result 747 states and 1043 transitions. [2024-10-11 16:36:06,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:36:06,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-11 16:36:06,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:06,542 INFO L225 Difference]: With dead ends: 747 [2024-10-11 16:36:06,543 INFO L226 Difference]: Without dead ends: 628 [2024-10-11 16:36:06,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:36:06,545 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 425 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:06,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 2109 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:36:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-10-11 16:36:06,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 319. [2024-10-11 16:36:06,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 314 states have internal predecessors, (441), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 447 transitions. [2024-10-11 16:36:06,569 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 447 transitions. Word has length 65 [2024-10-11 16:36:06,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:06,569 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 447 transitions. [2024-10-11 16:36:06,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:36:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 447 transitions. [2024-10-11 16:36:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 16:36:06,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:06,572 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:06,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:36:06,573 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:06,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:06,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1921741237, now seen corresponding path program 1 times [2024-10-11 16:36:06,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:06,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363541791] [2024-10-11 16:36:06,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:06,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:06,868 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:36:06,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:06,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363541791] [2024-10-11 16:36:06,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363541791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:06,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:06,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:36:06,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830620358] [2024-10-11 16:36:06,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:06,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:36:06,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:06,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:36:06,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:36:06,871 INFO L87 Difference]: Start difference. First operand 319 states and 447 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:36:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:06,950 INFO L93 Difference]: Finished difference Result 592 states and 824 transitions. [2024-10-11 16:36:06,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:36:06,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2024-10-11 16:36:06,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:06,952 INFO L225 Difference]: With dead ends: 592 [2024-10-11 16:36:06,952 INFO L226 Difference]: Without dead ends: 277 [2024-10-11 16:36:06,953 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:36:06,954 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 30 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 985 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:36:06,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 985 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:36:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-11 16:36:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-10-11 16:36:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 272 states have (on average 1.338235294117647) internal successors, (364), 272 states have internal predecessors, (364), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 370 transitions. [2024-10-11 16:36:06,968 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 370 transitions. Word has length 141 [2024-10-11 16:36:06,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:06,968 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 370 transitions. [2024-10-11 16:36:06,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:36:06,970 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 370 transitions. [2024-10-11 16:36:06,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 16:36:06,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:06,974 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:06,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:36:06,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:06,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:06,975 INFO L85 PathProgramCache]: Analyzing trace with hash 891918889, now seen corresponding path program 1 times [2024-10-11 16:36:06,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:06,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763692581] [2024-10-11 16:36:06,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:06,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:07,178 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:36:07,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:07,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763692581] [2024-10-11 16:36:07,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763692581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:07,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:07,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:36:07,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681888771] [2024-10-11 16:36:07,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:07,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:36:07,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:07,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:36:07,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:36:07,184 INFO L87 Difference]: Start difference. First operand 277 states and 370 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:36:07,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:07,263 INFO L93 Difference]: Finished difference Result 732 states and 982 transitions. [2024-10-11 16:36:07,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:36:07,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2024-10-11 16:36:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:07,267 INFO L225 Difference]: With dead ends: 732 [2024-10-11 16:36:07,267 INFO L226 Difference]: Without dead ends: 459 [2024-10-11 16:36:07,268 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:36:07,269 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 177 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:07,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 802 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:36:07,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-11 16:36:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2024-10-11 16:36:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 452 states have (on average 1.342920353982301) internal successors, (607), 452 states have internal predecessors, (607), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 613 transitions. [2024-10-11 16:36:07,284 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 613 transitions. Word has length 141 [2024-10-11 16:36:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:07,286 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 613 transitions. [2024-10-11 16:36:07,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:36:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 613 transitions. [2024-10-11 16:36:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 16:36:07,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:07,289 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:07,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:36:07,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:07,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:07,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1987483736, now seen corresponding path program 1 times [2024-10-11 16:36:07,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:07,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112783810] [2024-10-11 16:36:07,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:07,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:07,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:36:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:07,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:36:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:07,518 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:36:07,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:07,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112783810] [2024-10-11 16:36:07,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112783810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:07,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:07,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:36:07,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889801295] [2024-10-11 16:36:07,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:07,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:36:07,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:07,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:36:07,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:36:07,524 INFO L87 Difference]: Start difference. First operand 457 states and 613 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:07,718 INFO L93 Difference]: Finished difference Result 882 states and 1193 transitions. [2024-10-11 16:36:07,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:36:07,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2024-10-11 16:36:07,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:07,723 INFO L225 Difference]: With dead ends: 882 [2024-10-11 16:36:07,724 INFO L226 Difference]: Without dead ends: 459 [2024-10-11 16:36:07,725 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:36:07,725 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 3 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:07,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 967 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 16:36:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-11 16:36:07,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2024-10-11 16:36:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 452 states have (on average 1.329646017699115) internal successors, (601), 452 states have internal predecessors, (601), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 607 transitions. [2024-10-11 16:36:07,739 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 607 transitions. Word has length 154 [2024-10-11 16:36:07,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:07,740 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 607 transitions. [2024-10-11 16:36:07,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 607 transitions. [2024-10-11 16:36:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 16:36:07,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:07,742 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:07,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:36:07,742 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:07,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:07,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1445649958, now seen corresponding path program 1 times [2024-10-11 16:36:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:07,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494661664] [2024-10-11 16:36:07,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:07,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:08,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:36:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:08,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:36:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:08,038 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:36:08,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:08,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494661664] [2024-10-11 16:36:08,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494661664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:08,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:08,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:36:08,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203458448] [2024-10-11 16:36:08,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:08,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:36:08,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:08,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:36:08,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:36:08,041 INFO L87 Difference]: Start difference. First operand 457 states and 607 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:08,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:08,411 INFO L93 Difference]: Finished difference Result 904 states and 1207 transitions. [2024-10-11 16:36:08,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:36:08,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2024-10-11 16:36:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:08,415 INFO L225 Difference]: With dead ends: 904 [2024-10-11 16:36:08,415 INFO L226 Difference]: Without dead ends: 538 [2024-10-11 16:36:08,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:36:08,416 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 916 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:08,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1249 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:36:08,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-10-11 16:36:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 364. [2024-10-11 16:36:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 359 states have (on average 1.3203342618384402) internal successors, (474), 359 states have internal predecessors, (474), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2024-10-11 16:36:08,430 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 154 [2024-10-11 16:36:08,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:08,432 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2024-10-11 16:36:08,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:08,433 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2024-10-11 16:36:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 16:36:08,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:08,435 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:08,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:36:08,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:08,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:08,436 INFO L85 PathProgramCache]: Analyzing trace with hash 640569234, now seen corresponding path program 1 times [2024-10-11 16:36:08,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:08,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037066791] [2024-10-11 16:36:08,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:08,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:09,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:36:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:09,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:36:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:36:09,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:09,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037066791] [2024-10-11 16:36:09,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037066791] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:36:09,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183155640] [2024-10-11 16:36:09,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:09,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:09,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:36:09,156 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:36:09,165 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:36:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:09,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 16:36:09,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:36:09,663 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:36:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 16:36:10,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:36:10,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183155640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:10,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:36:10,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2024-10-11 16:36:10,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222054354] [2024-10-11 16:36:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:10,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:36:10,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:10,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:36:10,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:36:10,568 INFO L87 Difference]: Start difference. First operand 364 states and 480 transitions. Second operand has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:11,493 INFO L93 Difference]: Finished difference Result 663 states and 875 transitions. [2024-10-11 16:36:11,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:36:11,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 164 [2024-10-11 16:36:11,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:11,498 INFO L225 Difference]: With dead ends: 663 [2024-10-11 16:36:11,499 INFO L226 Difference]: Without dead ends: 547 [2024-10-11 16:36:11,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-10-11 16:36:11,501 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 358 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:11,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 2299 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:36:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-11 16:36:11,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 401. [2024-10-11 16:36:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.3005050505050506) internal successors, (515), 396 states have internal predecessors, (515), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 521 transitions. [2024-10-11 16:36:11,522 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 521 transitions. Word has length 164 [2024-10-11 16:36:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:11,524 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 521 transitions. [2024-10-11 16:36:11,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 521 transitions. [2024-10-11 16:36:11,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 16:36:11,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:11,527 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:11,549 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:36:11,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:11,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:11,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:11,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1572805270, now seen corresponding path program 1 times [2024-10-11 16:36:11,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:11,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022315432] [2024-10-11 16:36:11,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:11,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:12,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:36:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:12,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:36:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:36:12,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:12,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022315432] [2024-10-11 16:36:12,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022315432] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:36:12,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601451192] [2024-10-11 16:36:12,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:12,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:12,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:36:12,240 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:36:12,242 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:36:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:12,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 16:36:12,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:36:12,679 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:36:12,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-11 16:36:13,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 16:36:13,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 41 [2024-10-11 16:36:13,453 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:36:13,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:36:13,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601451192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:13,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:36:13,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-10-11 16:36:13,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050288592] [2024-10-11 16:36:13,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:13,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:36:13,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:13,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:36:13,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:36:13,456 INFO L87 Difference]: Start difference. First operand 401 states and 521 transitions. Second operand has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:15,026 INFO L93 Difference]: Finished difference Result 892 states and 1180 transitions. [2024-10-11 16:36:15,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:36:15,027 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 165 [2024-10-11 16:36:15,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:15,029 INFO L225 Difference]: With dead ends: 892 [2024-10-11 16:36:15,030 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 16:36:15,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-10-11 16:36:15,031 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 462 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:15,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1947 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 16:36:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 16:36:15,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 401. [2024-10-11 16:36:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.297979797979798) internal successors, (514), 396 states have internal predecessors, (514), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 520 transitions. [2024-10-11 16:36:15,053 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 520 transitions. Word has length 165 [2024-10-11 16:36:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:15,053 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 520 transitions. [2024-10-11 16:36:15,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 520 transitions. [2024-10-11 16:36:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 16:36:15,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:15,056 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:15,077 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:36:15,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:15,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:15,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:15,261 INFO L85 PathProgramCache]: Analyzing trace with hash 383929831, now seen corresponding path program 1 times [2024-10-11 16:36:15,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:15,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151070276] [2024-10-11 16:36:15,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:15,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:15,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 16:36:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:15,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 16:36:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:36:15,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:15,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151070276] [2024-10-11 16:36:15,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151070276] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:36:15,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229219852] [2024-10-11 16:36:15,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:15,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:15,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:36:15,784 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:36:15,786 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:36:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:16,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 16:36:16,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:36:16,433 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:36:16,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:36:16,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229219852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:16,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:36:16,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-11 16:36:16,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681188711] [2024-10-11 16:36:16,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:16,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:36:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:36:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:36:16,438 INFO L87 Difference]: Start difference. First operand 401 states and 520 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:16,579 INFO L93 Difference]: Finished difference Result 758 states and 993 transitions. [2024-10-11 16:36:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:36:16,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 166 [2024-10-11 16:36:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:16,582 INFO L225 Difference]: With dead ends: 758 [2024-10-11 16:36:16,582 INFO L226 Difference]: Without dead ends: 401 [2024-10-11 16:36:16,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:36:16,584 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 17 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:16,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 899 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:36:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-11 16:36:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2024-10-11 16:36:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.292929292929293) internal successors, (512), 396 states have internal predecessors, (512), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 518 transitions. [2024-10-11 16:36:16,602 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 518 transitions. Word has length 166 [2024-10-11 16:36:16,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:16,602 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 518 transitions. [2024-10-11 16:36:16,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 518 transitions. [2024-10-11 16:36:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 16:36:16,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:16,604 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:16,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 16:36:16,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:16,809 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:16,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:16,810 INFO L85 PathProgramCache]: Analyzing trace with hash -449005617, now seen corresponding path program 1 times [2024-10-11 16:36:16,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:16,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848160678] [2024-10-11 16:36:16,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:16,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:17,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:36:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:17,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:36:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:17,245 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:36:17,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:17,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848160678] [2024-10-11 16:36:17,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848160678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:17,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:17,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:36:17,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43506885] [2024-10-11 16:36:17,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:17,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:36:17,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:17,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:36:17,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:36:17,248 INFO L87 Difference]: Start difference. First operand 401 states and 518 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:17,654 INFO L93 Difference]: Finished difference Result 763 states and 1000 transitions. [2024-10-11 16:36:17,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:36:17,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2024-10-11 16:36:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:17,657 INFO L225 Difference]: With dead ends: 763 [2024-10-11 16:36:17,657 INFO L226 Difference]: Without dead ends: 409 [2024-10-11 16:36:17,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:36:17,658 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 10 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:17,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1449 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:36:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-11 16:36:17,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 407. [2024-10-11 16:36:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 402 states have (on average 1.2885572139303483) internal successors, (518), 402 states have internal predecessors, (518), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 524 transitions. [2024-10-11 16:36:17,680 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 524 transitions. Word has length 167 [2024-10-11 16:36:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:17,681 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 524 transitions. [2024-10-11 16:36:17,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:17,681 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 524 transitions. [2024-10-11 16:36:17,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:36:17,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:17,683 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:17,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 16:36:17,683 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:17,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:17,684 INFO L85 PathProgramCache]: Analyzing trace with hash -685947506, now seen corresponding path program 1 times [2024-10-11 16:36:17,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:17,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390428770] [2024-10-11 16:36:17,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:17,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:18,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:36:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:18,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:36:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:18,073 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:36:18,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:18,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390428770] [2024-10-11 16:36:18,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390428770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:18,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:18,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:36:18,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252796704] [2024-10-11 16:36:18,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:18,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:36:18,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:18,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:36:18,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:36:18,092 INFO L87 Difference]: Start difference. First operand 407 states and 524 transitions. Second operand has 8 states, 8 states have (on average 20.25) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:18,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:18,608 INFO L93 Difference]: Finished difference Result 769 states and 1004 transitions. [2024-10-11 16:36:18,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:36:18,609 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2024-10-11 16:36:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:18,611 INFO L225 Difference]: With dead ends: 769 [2024-10-11 16:36:18,611 INFO L226 Difference]: Without dead ends: 419 [2024-10-11 16:36:18,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:36:18,613 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 14 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:18,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1942 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:36:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-11 16:36:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2024-10-11 16:36:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.2878048780487805) internal successors, (528), 410 states have internal predecessors, (528), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 534 transitions. [2024-10-11 16:36:18,630 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 534 transitions. Word has length 168 [2024-10-11 16:36:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:18,630 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 534 transitions. [2024-10-11 16:36:18,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 534 transitions. [2024-10-11 16:36:18,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:36:18,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:18,633 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:18,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 16:36:18,633 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:18,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:18,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1317509590, now seen corresponding path program 1 times [2024-10-11 16:36:18,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:18,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590972070] [2024-10-11 16:36:18,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:18,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:19,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:36:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:19,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:36:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:36:19,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:19,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590972070] [2024-10-11 16:36:19,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590972070] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:36:19,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887301511] [2024-10-11 16:36:19,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:19,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:19,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:36:19,166 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:36:19,167 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:36:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:19,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 16:36:19,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:36:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 16:36:19,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:36:19,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887301511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:19,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:36:19,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-10-11 16:36:19,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019643685] [2024-10-11 16:36:19,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:19,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:36:19,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:19,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:36:19,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:36:19,718 INFO L87 Difference]: Start difference. First operand 415 states and 534 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:19,976 INFO L93 Difference]: Finished difference Result 531 states and 689 transitions. [2024-10-11 16:36:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:36:19,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2024-10-11 16:36:19,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:19,979 INFO L225 Difference]: With dead ends: 531 [2024-10-11 16:36:19,979 INFO L226 Difference]: Without dead ends: 415 [2024-10-11 16:36:19,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:36:19,981 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 34 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:19,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1406 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 16:36:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-11 16:36:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2024-10-11 16:36:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.2853658536585366) internal successors, (527), 410 states have internal predecessors, (527), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 533 transitions. [2024-10-11 16:36:19,995 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 533 transitions. Word has length 168 [2024-10-11 16:36:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:19,996 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 533 transitions. [2024-10-11 16:36:19,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 533 transitions. [2024-10-11 16:36:19,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 16:36:19,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:19,998 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:20,021 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:36:20,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 16:36:20,199 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:20,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:20,200 INFO L85 PathProgramCache]: Analyzing trace with hash 869226029, now seen corresponding path program 1 times [2024-10-11 16:36:20,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:20,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767759113] [2024-10-11 16:36:20,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:20,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:36:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:20,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:36:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 16:36:20,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:20,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767759113] [2024-10-11 16:36:20,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767759113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:20,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:20,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:36:20,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794340032] [2024-10-11 16:36:20,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:20,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:36:20,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:20,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:36:20,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:36:20,625 INFO L87 Difference]: Start difference. First operand 415 states and 533 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:21,070 INFO L93 Difference]: Finished difference Result 536 states and 697 transitions. [2024-10-11 16:36:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:36:21,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2024-10-11 16:36:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:21,075 INFO L225 Difference]: With dead ends: 536 [2024-10-11 16:36:21,075 INFO L226 Difference]: Without dead ends: 420 [2024-10-11 16:36:21,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:36:21,079 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 10 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:21,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1689 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:36:21,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-11 16:36:21,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 418. [2024-10-11 16:36:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 413 states have (on average 1.2832929782082325) internal successors, (530), 413 states have internal predecessors, (530), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 536 transitions. [2024-10-11 16:36:21,097 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 536 transitions. Word has length 169 [2024-10-11 16:36:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:21,097 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 536 transitions. [2024-10-11 16:36:21,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 536 transitions. [2024-10-11 16:36:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 16:36:21,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:21,100 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:21,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 16:36:21,100 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:21,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:21,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1783474243, now seen corresponding path program 1 times [2024-10-11 16:36:21,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:21,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000259939] [2024-10-11 16:36:21,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:21,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:21,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:36:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:36:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 16:36:21,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:21,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000259939] [2024-10-11 16:36:21,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000259939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:21,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:21,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:36:21,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93083992] [2024-10-11 16:36:21,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:21,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:36:21,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:21,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:36:21,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:36:21,482 INFO L87 Difference]: Start difference. First operand 418 states and 536 transitions. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:21,941 INFO L93 Difference]: Finished difference Result 544 states and 706 transitions. [2024-10-11 16:36:21,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:36:21,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2024-10-11 16:36:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:21,944 INFO L225 Difference]: With dead ends: 544 [2024-10-11 16:36:21,944 INFO L226 Difference]: Without dead ends: 425 [2024-10-11 16:36:21,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:36:21,945 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 14 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:21,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1935 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:36:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-11 16:36:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2024-10-11 16:36:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.2829736211031175) internal successors, (535), 417 states have internal predecessors, (535), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:36:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 541 transitions. [2024-10-11 16:36:21,961 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 541 transitions. Word has length 170 [2024-10-11 16:36:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:21,961 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 541 transitions. [2024-10-11 16:36:21,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 541 transitions. [2024-10-11 16:36:21,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 16:36:21,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:21,964 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:21,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 16:36:21,964 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:21,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:21,964 INFO L85 PathProgramCache]: Analyzing trace with hash 28326183, now seen corresponding path program 1 times [2024-10-11 16:36:21,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:21,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055445978] [2024-10-11 16:36:21,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:21,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:22,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:36:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:22,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:36:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:36:22,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055445978] [2024-10-11 16:36:22,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055445978] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:36:22,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847785292] [2024-10-11 16:36:22,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:22,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:22,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:36:22,376 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:36:22,377 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:36:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:23,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 16:36:23,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:36:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:36:23,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:36:23,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847785292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:23,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:36:23,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-11 16:36:23,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935615668] [2024-10-11 16:36:23,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:23,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:36:23,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:23,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:36:23,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:36:23,260 INFO L87 Difference]: Start difference. First operand 422 states and 541 transitions. Second operand has 4 states, 3 states have (on average 55.333333333333336) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:23,304 INFO L93 Difference]: Finished difference Result 745 states and 958 transitions. [2024-10-11 16:36:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:36:23,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 55.333333333333336) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2024-10-11 16:36:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:23,307 INFO L225 Difference]: With dead ends: 745 [2024-10-11 16:36:23,307 INFO L226 Difference]: Without dead ends: 424 [2024-10-11 16:36:23,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:36:23,308 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 0 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:23,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1040 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:36:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-10-11 16:36:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2024-10-11 16:36:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 418 states have (on average 1.284688995215311) internal successors, (537), 419 states have internal predecessors, (537), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 16:36:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 544 transitions. [2024-10-11 16:36:23,328 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 544 transitions. Word has length 170 [2024-10-11 16:36:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:23,329 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 544 transitions. [2024-10-11 16:36:23,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 55.333333333333336) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 544 transitions. [2024-10-11 16:36:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 16:36:23,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:23,331 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:23,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 16:36:23,532 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:36:23,533 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:23,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:23,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1558142539, now seen corresponding path program 1 times [2024-10-11 16:36:23,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:23,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372337828] [2024-10-11 16:36:23,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:23,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:23,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:36:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:24,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 16:36:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 16:36:24,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:24,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372337828] [2024-10-11 16:36:24,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372337828] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:36:24,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839586956] [2024-10-11 16:36:24,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:24,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:24,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:36:24,042 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:36:24,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 16:36:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:24,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 16:36:24,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:36:24,594 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:36:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:36:24,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:36:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 16:36:24,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839586956] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:36:24,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:36:24,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 14 [2024-10-11 16:36:24,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394895410] [2024-10-11 16:36:24,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:36:24,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 16:36:24,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:24,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 16:36:24,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:36:24,857 INFO L87 Difference]: Start difference. First operand 424 states and 544 transitions. Second operand has 14 states, 11 states have (on average 21.818181818181817) internal successors, (240), 12 states have internal predecessors, (240), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 16:36:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:25,628 INFO L93 Difference]: Finished difference Result 902 states and 1176 transitions. [2024-10-11 16:36:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 16:36:25,629 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 21.818181818181817) internal successors, (240), 12 states have internal predecessors, (240), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 172 [2024-10-11 16:36:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:25,632 INFO L225 Difference]: With dead ends: 902 [2024-10-11 16:36:25,632 INFO L226 Difference]: Without dead ends: 579 [2024-10-11 16:36:25,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2024-10-11 16:36:25,634 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 566 mSDsluCounter, 2146 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:25,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 2526 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:36:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-10-11 16:36:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 450. [2024-10-11 16:36:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 441 states have (on average 1.2970521541950113) internal successors, (572), 443 states have internal predecessors, (572), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 16:36:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 581 transitions. [2024-10-11 16:36:25,663 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 581 transitions. Word has length 172 [2024-10-11 16:36:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:25,663 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 581 transitions. [2024-10-11 16:36:25,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 21.818181818181817) internal successors, (240), 12 states have internal predecessors, (240), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 16:36:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 581 transitions. [2024-10-11 16:36:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 16:36:25,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:25,666 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:25,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 16:36:25,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 16:36:25,871 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:25,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:25,871 INFO L85 PathProgramCache]: Analyzing trace with hash 299225191, now seen corresponding path program 2 times [2024-10-11 16:36:25,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:25,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852373204] [2024-10-11 16:36:25,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:25,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:26,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:36:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:26,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:36:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 16:36:26,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:26,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852373204] [2024-10-11 16:36:26,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852373204] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:36:26,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311162159] [2024-10-11 16:36:26,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 16:36:26,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:26,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:36:26,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:36:26,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 16:36:27,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 16:36:27,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 16:36:27,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 16:36:27,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:36:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 16:36:47,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:36:47,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311162159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:47,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:36:47,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2024-10-11 16:36:47,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241326313] [2024-10-11 16:36:47,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:47,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:36:47,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:47,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:36:47,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:36:47,739 INFO L87 Difference]: Start difference. First operand 450 states and 581 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:36:52,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 16:36:53,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 16:36:58,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 16:37:02,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 16:37:06,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 16:37:11,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 16:37:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:37:11,406 INFO L93 Difference]: Finished difference Result 578 states and 751 transitions. [2024-10-11 16:37:11,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:37:11,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2024-10-11 16:37:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:37:11,409 INFO L225 Difference]: With dead ends: 578 [2024-10-11 16:37:11,409 INFO L226 Difference]: Without dead ends: 455 [2024-10-11 16:37:11,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:37:11,412 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 12 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:37:11,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1672 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 432 Invalid, 5 Unknown, 0 Unchecked, 23.6s Time] [2024-10-11 16:37:11,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-10-11 16:37:11,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 450. [2024-10-11 16:37:11,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 441 states have (on average 1.2970521541950113) internal successors, (572), 443 states have internal predecessors, (572), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 16:37:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 581 transitions. [2024-10-11 16:37:11,436 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 581 transitions. Word has length 176 [2024-10-11 16:37:11,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:37:11,436 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 581 transitions. [2024-10-11 16:37:11,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:37:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 581 transitions. [2024-10-11 16:37:11,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 16:37:11,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:11,438 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:37:11,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 16:37:11,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 16:37:11,643 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:11,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:11,644 INFO L85 PathProgramCache]: Analyzing trace with hash -622701375, now seen corresponding path program 1 times [2024-10-11 16:37:11,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:11,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748469700] [2024-10-11 16:37:11,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:11,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:37:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:12,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:37:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:12,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:37:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 16:37:12,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:37:12,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748469700] [2024-10-11 16:37:12,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748469700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:37:12,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:37:12,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:37:12,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191921213] [2024-10-11 16:37:12,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:37:12,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:37:12,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:37:12,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:37:12,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:37:12,239 INFO L87 Difference]: Start difference. First operand 450 states and 581 transitions. Second operand has 10 states, 10 states have (on average 16.5) internal successors, (165), 9 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:37:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:37:13,019 INFO L93 Difference]: Finished difference Result 586 states and 761 transitions. [2024-10-11 16:37:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:37:13,020 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 9 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 177 [2024-10-11 16:37:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:37:13,023 INFO L225 Difference]: With dead ends: 586 [2024-10-11 16:37:13,023 INFO L226 Difference]: Without dead ends: 463 [2024-10-11 16:37:13,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:37:13,026 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 22 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:37:13,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2542 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:37:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-11 16:37:13,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 457. [2024-10-11 16:37:13,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 448 states have (on average 1.296875) internal successors, (581), 450 states have internal predecessors, (581), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 16:37:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 590 transitions. [2024-10-11 16:37:13,051 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 590 transitions. Word has length 177 [2024-10-11 16:37:13,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:37:13,052 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 590 transitions. [2024-10-11 16:37:13,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 9 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:37:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 590 transitions. [2024-10-11 16:37:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 16:37:13,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:13,054 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:37:13,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 16:37:13,054 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:13,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:13,055 INFO L85 PathProgramCache]: Analyzing trace with hash 802283613, now seen corresponding path program 1 times [2024-10-11 16:37:13,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:13,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907990902] [2024-10-11 16:37:13,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:13,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:37:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:13,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:37:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:13,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:37:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 16:37:13,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:37:13,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907990902] [2024-10-11 16:37:13,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907990902] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:37:13,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177750095] [2024-10-11 16:37:13,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:13,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:37:13,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:37:13,743 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:37:13,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 16:37:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:14,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 16:37:14,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:37:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 16:37:14,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:37:14,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177750095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:37:14,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:37:14,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-10-11 16:37:14,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922454550] [2024-10-11 16:37:14,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:37:14,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:37:14,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:37:14,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:37:14,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-11 16:37:14,505 INFO L87 Difference]: Start difference. First operand 457 states and 590 transitions. Second operand has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:37:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:37:15,165 INFO L93 Difference]: Finished difference Result 597 states and 775 transitions. [2024-10-11 16:37:15,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:37:15,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 177 [2024-10-11 16:37:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:37:15,168 INFO L225 Difference]: With dead ends: 597 [2024-10-11 16:37:15,170 INFO L226 Difference]: Without dead ends: 467 [2024-10-11 16:37:15,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-11 16:37:15,171 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 17 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:37:15,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1967 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:37:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-10-11 16:37:15,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 462. [2024-10-11 16:37:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 453 states have (on average 1.2958057395143487) internal successors, (587), 455 states have internal predecessors, (587), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 16:37:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 596 transitions. [2024-10-11 16:37:15,195 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 596 transitions. Word has length 177 [2024-10-11 16:37:15,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:37:15,195 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 596 transitions. [2024-10-11 16:37:15,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:37:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 596 transitions. [2024-10-11 16:37:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 16:37:15,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:15,197 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:37:15,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 16:37:15,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:37:15,399 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:15,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash 525928279, now seen corresponding path program 1 times [2024-10-11 16:37:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:15,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685124633] [2024-10-11 16:37:15,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:15,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:37:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:16,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:37:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:16,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:37:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 16:37:16,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:37:16,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685124633] [2024-10-11 16:37:16,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685124633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:37:16,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:37:16,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 16:37:16,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890694291] [2024-10-11 16:37:16,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:37:16,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:37:16,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:37:16,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:37:16,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:37:16,035 INFO L87 Difference]: Start difference. First operand 462 states and 596 transitions. Second operand has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 10 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:37:16,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:37:16,875 INFO L93 Difference]: Finished difference Result 609 states and 791 transitions. [2024-10-11 16:37:16,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:37:16,876 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 10 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 178 [2024-10-11 16:37:16,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:37:16,878 INFO L225 Difference]: With dead ends: 609 [2024-10-11 16:37:16,878 INFO L226 Difference]: Without dead ends: 474 [2024-10-11 16:37:16,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:37:16,880 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 25 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2566 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:37:16,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2566 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 16:37:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-11 16:37:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 465. [2024-10-11 16:37:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 456 states have (on average 1.293859649122807) internal successors, (590), 458 states have internal predecessors, (590), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 16:37:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 599 transitions. [2024-10-11 16:37:16,909 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 599 transitions. Word has length 178 [2024-10-11 16:37:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:37:16,910 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 599 transitions. [2024-10-11 16:37:16,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 10 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:37:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 599 transitions. [2024-10-11 16:37:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 16:37:16,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:16,911 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:37:16,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 16:37:16,912 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:16,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1750789947, now seen corresponding path program 1 times [2024-10-11 16:37:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:16,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349497764] [2024-10-11 16:37:16,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:16,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:37:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:17,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:37:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:17,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:37:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 16:37:17,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:37:17,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349497764] [2024-10-11 16:37:17,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349497764] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:37:17,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894417519] [2024-10-11 16:37:17,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:17,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:37:17,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:37:17,667 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:37:17,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 16:37:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:18,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 16:37:18,173 INFO L278 TraceCheckSpWp]: Computing forward predicates...