./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 14:40:04,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 14:40:05,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 14:40:05,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 14:40:05,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 14:40:05,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 14:40:05,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 14:40:05,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 14:40:05,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 14:40:05,080 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 14:40:05,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 14:40:05,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 14:40:05,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 14:40:05,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 14:40:05,081 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 14:40:05,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 14:40:05,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 14:40:05,082 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 14:40:05,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 14:40:05,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 14:40:05,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 14:40:05,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 14:40:05,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 14:40:05,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 14:40:05,084 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 14:40:05,084 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 14:40:05,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 14:40:05,085 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 14:40:05,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 14:40:05,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 14:40:05,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 14:40:05,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 14:40:05,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:40:05,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 14:40:05,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 14:40:05,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 14:40:05,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 14:40:05,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 14:40:05,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 14:40:05,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 14:40:05,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 14:40:05,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 14:40:05,088 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-10-24 14:40:05,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 14:40:05,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 14:40:05,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 14:40:05,302 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 14:40:05,303 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 14:40:05,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i [2024-10-24 14:40:06,518 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 14:40:06,751 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 14:40:06,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i [2024-10-24 14:40:06,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4daf334/db1771c866c443199cf7652e944123ef/FLAG06db2b828 [2024-10-24 14:40:07,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4daf334/db1771c866c443199cf7652e944123ef [2024-10-24 14:40:07,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 14:40:07,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 14:40:07,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 14:40:07,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 14:40:07,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 14:40:07,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:40:07" (1/1) ... [2024-10-24 14:40:07,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c611ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:07, skipping insertion in model container [2024-10-24 14:40:07,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:40:07" (1/1) ... [2024-10-24 14:40:07,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 14:40:07,489 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i[37435,37448] [2024-10-24 14:40:07,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:40:07,570 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 14:40:07,595 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i[37435,37448] [2024-10-24 14:40:07,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:40:07,665 INFO L204 MainTranslator]: Completed translation [2024-10-24 14:40:07,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:07 WrapperNode [2024-10-24 14:40:07,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 14:40:07,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 14:40:07,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 14:40:07,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 14:40:07,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:07" (1/1) ... [2024-10-24 14:40:07,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:07" (1/1) ... [2024-10-24 14:40:07,737 INFO L138 Inliner]: procedures = 207, calls = 221, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1277 [2024-10-24 14:40:07,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 14:40:07,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 14:40:07,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 14:40:07,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 14:40:07,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:07" (1/1) ... [2024-10-24 14:40:07,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:07" (1/1) ... [2024-10-24 14:40:07,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:07" (1/1) ... [2024-10-24 14:40:07,804 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [170, 2, 34]. 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 [42, 0, 4]. [2024-10-24 14:40:07,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:07" (1/1) ... [2024-10-24 14:40:07,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:07" (1/1) ... [2024-10-24 14:40:07,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:07" (1/1) ... [2024-10-24 14:40:07,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:07" (1/1) ... [2024-10-24 14:40:07,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:07" (1/1) ... [2024-10-24 14:40:07,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:07" (1/1) ... [2024-10-24 14:40:07,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 14:40:07,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 14:40:07,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 14:40:07,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 14:40:07,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:07" (1/1) ... [2024-10-24 14:40:07,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:40:07,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:40:07,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 14:40:07,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 14:40:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 14:40:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 14:40:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 14:40:07,936 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 14:40:07,936 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 14:40:07,936 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 14:40:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 14:40:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 14:40:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 14:40:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 14:40:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 14:40:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 14:40:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 14:40:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 14:40:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 14:40:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 14:40:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 14:40:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 14:40:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 14:40:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 14:40:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 14:40:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 14:40:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 14:40:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 14:40:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 14:40:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 14:40:07,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 14:40:08,098 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 14:40:08,100 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 14:40:09,070 INFO L? ?]: Removed 294 outVars from TransFormulas that were not future-live. [2024-10-24 14:40:09,071 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 14:40:09,102 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 14:40:09,102 INFO L314 CfgBuilder]: Removed 54 assume(true) statements. [2024-10-24 14:40:09,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:40:09 BoogieIcfgContainer [2024-10-24 14:40:09,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 14:40:09,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 14:40:09,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 14:40:09,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 14:40:09,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:40:07" (1/3) ... [2024-10-24 14:40:09,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49cc9f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:40:09, skipping insertion in model container [2024-10-24 14:40:09,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:07" (2/3) ... [2024-10-24 14:40:09,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49cc9f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:40:09, skipping insertion in model container [2024-10-24 14:40:09,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:40:09" (3/3) ... [2024-10-24 14:40:09,110 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test2-1.i [2024-10-24 14:40:09,123 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 14:40:09,124 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 14:40:09,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 14:40:09,189 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;@4a822593, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 14:40:09,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 14:40:09,193 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-24 14:40:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 14:40:09,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:09,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:40:09,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:09,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:09,203 INFO L85 PathProgramCache]: Analyzing trace with hash 685924647, now seen corresponding path program 1 times [2024-10-24 14:40:09,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:09,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155243638] [2024-10-24 14:40:09,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:09,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:40:09,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:09,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155243638] [2024-10-24 14:40:09,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155243638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:09,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:40:09,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 14:40:09,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901054609] [2024-10-24 14:40:09,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:09,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 14:40:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:09,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 14:40:09,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 14:40:09,377 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-24 14:40:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:09,444 INFO L93 Difference]: Finished difference Result 722 states and 1167 transitions. [2024-10-24 14:40:09,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 14:40:09,446 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-24 14:40:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:09,457 INFO L225 Difference]: With dead ends: 722 [2024-10-24 14:40:09,458 INFO L226 Difference]: Without dead ends: 359 [2024-10-24 14:40:09,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 14:40:09,463 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-24 14:40:09,463 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-24 14:40:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-24 14:40:09,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-24 14:40:09,508 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-24 14:40:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 522 transitions. [2024-10-24 14:40:09,511 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 522 transitions. Word has length 10 [2024-10-24 14:40:09,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:09,511 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 522 transitions. [2024-10-24 14:40:09,511 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-24 14:40:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2024-10-24 14:40:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 14:40:09,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:09,515 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-24 14:40:09,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 14:40:09,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:09,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:09,516 INFO L85 PathProgramCache]: Analyzing trace with hash -347738900, now seen corresponding path program 1 times [2024-10-24 14:40:09,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:09,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718471224] [2024-10-24 14:40:09,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:09,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:40:09,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:09,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718471224] [2024-10-24 14:40:09,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718471224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:09,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:40:09,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 14:40:09,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772576364] [2024-10-24 14:40:09,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:09,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 14:40:09,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:09,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 14:40:09,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 14:40:09,859 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-24 14:40:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:09,980 INFO L93 Difference]: Finished difference Result 475 states and 689 transitions. [2024-10-24 14:40:09,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 14:40:09,981 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-24 14:40:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:09,983 INFO L225 Difference]: With dead ends: 475 [2024-10-24 14:40:09,983 INFO L226 Difference]: Without dead ends: 317 [2024-10-24 14:40:09,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 14:40:09,985 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-24 14:40:09,986 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-24 14:40:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-24 14:40:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-10-24 14:40:10,007 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-24 14:40:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 445 transitions. [2024-10-24 14:40:10,011 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 445 transitions. Word has length 65 [2024-10-24 14:40:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:10,012 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 445 transitions. [2024-10-24 14:40:10,012 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-24 14:40:10,012 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 445 transitions. [2024-10-24 14:40:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 14:40:10,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:10,014 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-24 14:40:10,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 14:40:10,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:10,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:10,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1528203272, now seen corresponding path program 1 times [2024-10-24 14:40:10,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:10,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785256937] [2024-10-24 14:40:10,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:10,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:40:10,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:10,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785256937] [2024-10-24 14:40:10,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785256937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:10,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:40:10,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 14:40:10,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509889646] [2024-10-24 14:40:10,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:10,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 14:40:10,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:10,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 14:40:10,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:40:10,442 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-24 14:40:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:10,578 INFO L93 Difference]: Finished difference Result 747 states and 1043 transitions. [2024-10-24 14:40:10,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 14:40:10,581 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-24 14:40:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:10,583 INFO L225 Difference]: With dead ends: 747 [2024-10-24 14:40:10,583 INFO L226 Difference]: Without dead ends: 628 [2024-10-24 14:40:10,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:40:10,585 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-24 14:40:10,587 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-24 14:40:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-10-24 14:40:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 319. [2024-10-24 14:40:10,606 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-24 14:40:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 447 transitions. [2024-10-24 14:40:10,608 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 447 transitions. Word has length 65 [2024-10-24 14:40:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:10,608 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 447 transitions. [2024-10-24 14:40:10,608 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-24 14:40:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 447 transitions. [2024-10-24 14:40:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 14:40:10,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:10,616 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-24 14:40:10,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 14:40:10,617 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:10,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:10,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1921741237, now seen corresponding path program 1 times [2024-10-24 14:40:10,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:10,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599188150] [2024-10-24 14:40:10,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:10,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:40:10,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:10,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599188150] [2024-10-24 14:40:10,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599188150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:10,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:40:10,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 14:40:10,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536506068] [2024-10-24 14:40:10,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:10,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 14:40:10,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:10,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 14:40:10,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 14:40:10,878 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-24 14:40:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:10,946 INFO L93 Difference]: Finished difference Result 592 states and 824 transitions. [2024-10-24 14:40:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 14:40:10,947 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-24 14:40:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:10,948 INFO L225 Difference]: With dead ends: 592 [2024-10-24 14:40:10,948 INFO L226 Difference]: Without dead ends: 277 [2024-10-24 14:40:10,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 14:40:10,950 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 30 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-24 14:40:10,950 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-24 14:40:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-24 14:40:10,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-10-24 14:40:10,960 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-24 14:40:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 370 transitions. [2024-10-24 14:40:10,961 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 370 transitions. Word has length 141 [2024-10-24 14:40:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:10,962 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 370 transitions. [2024-10-24 14:40:10,962 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-24 14:40:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 370 transitions. [2024-10-24 14:40:10,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 14:40:10,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:10,964 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-24 14:40:10,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 14:40:10,964 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:10,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:10,965 INFO L85 PathProgramCache]: Analyzing trace with hash 891918889, now seen corresponding path program 1 times [2024-10-24 14:40:10,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:10,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221451362] [2024-10-24 14:40:10,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:10,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:40:11,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:11,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221451362] [2024-10-24 14:40:11,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221451362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:11,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:40:11,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 14:40:11,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796541223] [2024-10-24 14:40:11,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:11,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 14:40:11,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:11,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 14:40:11,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 14:40:11,115 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-24 14:40:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:11,169 INFO L93 Difference]: Finished difference Result 732 states and 982 transitions. [2024-10-24 14:40:11,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 14:40:11,169 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-24 14:40:11,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:11,171 INFO L225 Difference]: With dead ends: 732 [2024-10-24 14:40:11,171 INFO L226 Difference]: Without dead ends: 459 [2024-10-24 14:40:11,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 14:40:11,173 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 177 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-10-24 14:40:11,173 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.0s Time] [2024-10-24 14:40:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-24 14:40:11,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2024-10-24 14:40:11,182 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-24 14:40:11,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 613 transitions. [2024-10-24 14:40:11,183 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 613 transitions. Word has length 141 [2024-10-24 14:40:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:11,184 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 613 transitions. [2024-10-24 14:40:11,184 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-24 14:40:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 613 transitions. [2024-10-24 14:40:11,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-24 14:40:11,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:11,186 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-24 14:40:11,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 14:40:11,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:11,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:11,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1557256294, now seen corresponding path program 1 times [2024-10-24 14:40:11,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:11,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995220464] [2024-10-24 14:40:11,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:11,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:11,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 14:40:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:11,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 14:40:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:40:11,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995220464] [2024-10-24 14:40:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995220464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:11,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:40:11,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 14:40:11,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360374730] [2024-10-24 14:40:11,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:11,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 14:40:11,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:11,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 14:40:11,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 14:40:11,368 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-24 14:40:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:11,517 INFO L93 Difference]: Finished difference Result 882 states and 1193 transitions. [2024-10-24 14:40:11,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 14:40:11,518 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-24 14:40:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:11,521 INFO L225 Difference]: With dead ends: 882 [2024-10-24 14:40:11,521 INFO L226 Difference]: Without dead ends: 459 [2024-10-24 14:40:11,523 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-24 14:40:11,525 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:40:11,525 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.1s Time] [2024-10-24 14:40:11,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-24 14:40:11,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2024-10-24 14:40:11,535 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-24 14:40:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 607 transitions. [2024-10-24 14:40:11,537 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 607 transitions. Word has length 154 [2024-10-24 14:40:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:11,537 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 607 transitions. [2024-10-24 14:40:11,537 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-24 14:40:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 607 transitions. [2024-10-24 14:40:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-24 14:40:11,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:11,539 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-24 14:40:11,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 14:40:11,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:11,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:11,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1875877400, now seen corresponding path program 1 times [2024-10-24 14:40:11,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:11,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796986453] [2024-10-24 14:40:11,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:11,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:11,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 14:40:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:11,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 14:40:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:40:11,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:11,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796986453] [2024-10-24 14:40:11,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796986453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:11,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:40:11,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:40:11,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037225116] [2024-10-24 14:40:11,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:11,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:40:11,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:11,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:40:11,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:40:11,853 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-24 14:40:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:12,146 INFO L93 Difference]: Finished difference Result 904 states and 1207 transitions. [2024-10-24 14:40:12,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 14:40:12,147 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-24 14:40:12,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:12,150 INFO L225 Difference]: With dead ends: 904 [2024-10-24 14:40:12,150 INFO L226 Difference]: Without dead ends: 538 [2024-10-24 14:40:12,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:40:12,152 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 916 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-24 14:40:12,152 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-24 14:40:12,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-10-24 14:40:12,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 364. [2024-10-24 14:40:12,163 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-24 14:40:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2024-10-24 14:40:12,164 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 154 [2024-10-24 14:40:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:12,164 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2024-10-24 14:40:12,165 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-24 14:40:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2024-10-24 14:40:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 14:40:12,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:12,166 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-24 14:40:12,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 14:40:12,167 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:12,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:12,167 INFO L85 PathProgramCache]: Analyzing trace with hash -463386364, now seen corresponding path program 1 times [2024-10-24 14:40:12,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:12,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373919131] [2024-10-24 14:40:12,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:12,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:12,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 14:40:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:12,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 14:40:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:12,607 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-24 14:40:12,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373919131] [2024-10-24 14:40:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373919131] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:40:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690075479] [2024-10-24 14:40:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:12,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:40:12,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:40:12,610 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 14:40:12,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 14:40:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:12,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 14:40:12,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:40:12,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 14:40:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 14:40:13,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 14:40:13,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690075479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:13,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 14:40:13,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2024-10-24 14:40:13,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062877579] [2024-10-24 14:40:13,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:13,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 14:40:13,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:13,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 14:40:13,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-24 14:40:13,582 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-24 14:40:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:14,281 INFO L93 Difference]: Finished difference Result 663 states and 875 transitions. [2024-10-24 14:40:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 14:40:14,282 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-24 14:40:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:14,284 INFO L225 Difference]: With dead ends: 663 [2024-10-24 14:40:14,284 INFO L226 Difference]: Without dead ends: 547 [2024-10-24 14:40:14,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-10-24 14:40:14,285 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 358 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-24 14:40:14,285 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.5s Time] [2024-10-24 14:40:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-24 14:40:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 401. [2024-10-24 14:40:14,295 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-24 14:40:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 521 transitions. [2024-10-24 14:40:14,298 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 521 transitions. Word has length 164 [2024-10-24 14:40:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:14,298 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 521 transitions. [2024-10-24 14:40:14,298 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-24 14:40:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 521 transitions. [2024-10-24 14:40:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 14:40:14,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:14,300 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-24 14:40:14,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 14:40:14,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:40:14,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:14,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1435690440, now seen corresponding path program 1 times [2024-10-24 14:40:14,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:14,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635038951] [2024-10-24 14:40:14,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:14,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 14:40:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:14,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 14:40:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:14,979 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-24 14:40:14,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:14,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635038951] [2024-10-24 14:40:14,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635038951] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:40:14,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326537213] [2024-10-24 14:40:14,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:14,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:40:14,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:40:14,981 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 14:40:14,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 14:40:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:15,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 14:40:15,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:40:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:40:15,425 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 14:40:15,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326537213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:15,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 14:40:15,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-10-24 14:40:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525390011] [2024-10-24 14:40:15,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:15,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:40:15,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:15,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:40:15,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:40:15,427 INFO L87 Difference]: Start difference. First operand 401 states and 521 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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-24 14:40:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:15,648 INFO L93 Difference]: Finished difference Result 768 states and 1010 transitions. [2024-10-24 14:40:15,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 14:40:15,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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-24 14:40:15,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:15,651 INFO L225 Difference]: With dead ends: 768 [2024-10-24 14:40:15,651 INFO L226 Difference]: Without dead ends: 411 [2024-10-24 14:40:15,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:40:15,653 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 12 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 14:40:15,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1184 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 14:40:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-10-24 14:40:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2024-10-24 14:40:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 404 states have (on average 1.2945544554455446) internal successors, (523), 404 states have internal predecessors, (523), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:40:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 529 transitions. [2024-10-24 14:40:15,670 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 529 transitions. Word has length 165 [2024-10-24 14:40:15,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:15,671 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 529 transitions. [2024-10-24 14:40:15,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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-24 14:40:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 529 transitions. [2024-10-24 14:40:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 14:40:15,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:15,673 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-24 14:40:15,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 14:40:15,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-24 14:40:15,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:15,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:15,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1026883551, now seen corresponding path program 1 times [2024-10-24 14:40:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:15,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323970100] [2024-10-24 14:40:15,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:16,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 14:40:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:16,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 14:40:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:16,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:40:16,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:16,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323970100] [2024-10-24 14:40:16,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323970100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:16,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:40:16,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 14:40:16,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969007378] [2024-10-24 14:40:16,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:16,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 14:40:16,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:16,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 14:40:16,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 14:40:16,178 INFO L87 Difference]: Start difference. First operand 409 states and 529 transitions. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 7 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-24 14:40:16,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:16,558 INFO L93 Difference]: Finished difference Result 772 states and 1011 transitions. [2024-10-24 14:40:16,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 14:40:16,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 7 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-24 14:40:16,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:16,560 INFO L225 Difference]: With dead ends: 772 [2024-10-24 14:40:16,560 INFO L226 Difference]: Without dead ends: 421 [2024-10-24 14:40:16,561 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-24 14:40:16,561 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 16 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 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.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:40:16,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1942 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 14:40:16,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-24 14:40:16,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 417. [2024-10-24 14:40:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 412 states have (on average 1.2936893203883495) internal successors, (533), 412 states have internal predecessors, (533), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:40:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 539 transitions. [2024-10-24 14:40:16,574 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 539 transitions. Word has length 166 [2024-10-24 14:40:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:16,575 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 539 transitions. [2024-10-24 14:40:16,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 7 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-24 14:40:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 539 transitions. [2024-10-24 14:40:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 14:40:16,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:16,577 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-24 14:40:16,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 14:40:16,577 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:16,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:16,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1535033284, now seen corresponding path program 1 times [2024-10-24 14:40:16,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:16,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815095653] [2024-10-24 14:40:16,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:16,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:17,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 14:40:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:17,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:40:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:40:17,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:17,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815095653] [2024-10-24 14:40:17,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815095653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:17,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:40:17,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 14:40:17,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977737418] [2024-10-24 14:40:17,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:17,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 14:40:17,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:17,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 14:40:17,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:40:17,060 INFO L87 Difference]: Start difference. First operand 417 states and 539 transitions. Second operand has 10 states, 10 states have (on average 16.1) internal successors, (161), 9 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-24 14:40:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:17,634 INFO L93 Difference]: Finished difference Result 801 states and 1050 transitions. [2024-10-24 14:40:17,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 14:40:17,634 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 9 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-24 14:40:17,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:17,636 INFO L225 Difference]: With dead ends: 801 [2024-10-24 14:40:17,636 INFO L226 Difference]: Without dead ends: 441 [2024-10-24 14:40:17,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-24 14:40:17,637 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 34 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 14:40:17,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2576 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 14:40:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-10-24 14:40:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 433. [2024-10-24 14:40:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 428 states have (on average 1.2920560747663552) internal successors, (553), 428 states have internal predecessors, (553), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:40:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 559 transitions. [2024-10-24 14:40:17,649 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 559 transitions. Word has length 167 [2024-10-24 14:40:17,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:17,649 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 559 transitions. [2024-10-24 14:40:17,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 9 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-24 14:40:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 559 transitions. [2024-10-24 14:40:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 14:40:17,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:17,651 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-24 14:40:17,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 14:40:17,651 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:17,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:17,652 INFO L85 PathProgramCache]: Analyzing trace with hash -311890787, now seen corresponding path program 1 times [2024-10-24 14:40:17,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:17,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444233855] [2024-10-24 14:40:17,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:17,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 14:40:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:17,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:40:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:40:17,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:17,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444233855] [2024-10-24 14:40:17,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444233855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:17,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:40:17,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 14:40:17,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724154024] [2024-10-24 14:40:17,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:17,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 14:40:17,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:17,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 14:40:17,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:40:17,948 INFO L87 Difference]: Start difference. First operand 433 states and 559 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-24 14:40:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:18,234 INFO L93 Difference]: Finished difference Result 811 states and 1061 transitions. [2024-10-24 14:40:18,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:40:18,235 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-24 14:40:18,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:18,237 INFO L225 Difference]: With dead ends: 811 [2024-10-24 14:40:18,237 INFO L226 Difference]: Without dead ends: 441 [2024-10-24 14:40:18,237 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-24 14:40:18,238 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 10 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:40:18,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1451 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 14:40:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-10-24 14:40:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 439. [2024-10-24 14:40:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 434 states have (on average 1.2880184331797235) internal successors, (559), 434 states have internal predecessors, (559), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:40:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 565 transitions. [2024-10-24 14:40:18,254 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 565 transitions. Word has length 167 [2024-10-24 14:40:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:18,254 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 565 transitions. [2024-10-24 14:40:18,254 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-24 14:40:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 565 transitions. [2024-10-24 14:40:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 14:40:18,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:18,256 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-24 14:40:18,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 14:40:18,256 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:18,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:18,257 INFO L85 PathProgramCache]: Analyzing trace with hash 825800612, now seen corresponding path program 1 times [2024-10-24 14:40:18,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:18,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823970071] [2024-10-24 14:40:18,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:18,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:18,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:40:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:18,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:40:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:18,563 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-24 14:40:18,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:18,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823970071] [2024-10-24 14:40:18,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823970071] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:40:18,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997561904] [2024-10-24 14:40:18,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:18,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:40:18,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:40:18,567 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 14:40:18,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 14:40:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:18,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 14:40:18,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:40:18,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 14:40:18,922 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 22 treesize of output 7 [2024-10-24 14:40:19,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 14:40:19,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2024-10-24 14:40:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:40:19,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 14:40:19,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997561904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:19,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 14:40:19,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-10-24 14:40:19,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628728218] [2024-10-24 14:40:19,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:19,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 14:40:19,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:19,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 14:40:19,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-24 14:40:19,383 INFO L87 Difference]: Start difference. First operand 439 states and 565 transitions. Second operand has 11 states, 11 states have (on average 14.727272727272727) internal successors, (162), 11 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-24 14:40:23,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 14:40:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:24,674 INFO L93 Difference]: Finished difference Result 941 states and 1233 transitions. [2024-10-24 14:40:24,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 14:40:24,675 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.727272727272727) internal successors, (162), 11 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-24 14:40:24,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:24,676 INFO L225 Difference]: With dead ends: 941 [2024-10-24 14:40:24,676 INFO L226 Difference]: Without dead ends: 561 [2024-10-24 14:40:24,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-10-24 14:40:24,677 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 460 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-24 14:40:24,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1770 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 415 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2024-10-24 14:40:24,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-10-24 14:40:24,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 427. [2024-10-24 14:40:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 422 states have (on average 1.2867298578199051) internal successors, (543), 422 states have internal predecessors, (543), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:40:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 549 transitions. [2024-10-24 14:40:24,689 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 549 transitions. Word has length 168 [2024-10-24 14:40:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:24,689 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 549 transitions. [2024-10-24 14:40:24,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.727272727272727) internal successors, (162), 11 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-24 14:40:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 549 transitions. [2024-10-24 14:40:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 14:40:24,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:24,691 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-24 14:40:24,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 14:40:24,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:40:24,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:24,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1180394760, now seen corresponding path program 1 times [2024-10-24 14:40:24,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:24,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680931301] [2024-10-24 14:40:24,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:24,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:25,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:40:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:25,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:40:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:25,236 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-24 14:40:25,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:25,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680931301] [2024-10-24 14:40:25,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680931301] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:40:25,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929663878] [2024-10-24 14:40:25,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:25,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:40:25,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:40:25,238 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 14:40:25,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 14:40:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:25,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 14:40:25,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:40:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 14:40:25,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 14:40:25,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929663878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:25,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 14:40:25,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-10-24 14:40:25,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966382945] [2024-10-24 14:40:25,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:25,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:40:25,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:25,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:40:25,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:40:25,681 INFO L87 Difference]: Start difference. First operand 427 states and 549 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-24 14:40:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:25,969 INFO L93 Difference]: Finished difference Result 543 states and 704 transitions. [2024-10-24 14:40:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 14:40:25,970 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-24 14:40:25,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:25,971 INFO L225 Difference]: With dead ends: 543 [2024-10-24 14:40:25,971 INFO L226 Difference]: Without dead ends: 427 [2024-10-24 14:40:25,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:40:25,972 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.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:40:25,972 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.3s Time] [2024-10-24 14:40:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-24 14:40:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2024-10-24 14:40:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 422 states have (on average 1.2843601895734598) internal successors, (542), 422 states have internal predecessors, (542), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:40:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 548 transitions. [2024-10-24 14:40:25,982 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 548 transitions. Word has length 168 [2024-10-24 14:40:25,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:25,982 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 548 transitions. [2024-10-24 14:40:25,983 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-24 14:40:25,983 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 548 transitions. [2024-10-24 14:40:25,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 14:40:25,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:25,984 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-24 14:40:26,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 14:40:26,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:40:26,185 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:26,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash 824818463, now seen corresponding path program 1 times [2024-10-24 14:40:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:26,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888254183] [2024-10-24 14:40:26,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:26,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:26,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:40:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:26,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:40:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 14:40:26,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:26,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888254183] [2024-10-24 14:40:26,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888254183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:26,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:40:26,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 14:40:26,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273132549] [2024-10-24 14:40:26,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:26,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 14:40:26,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:26,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 14:40:26,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:40:26,493 INFO L87 Difference]: Start difference. First operand 427 states and 548 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-24 14:40:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:26,921 INFO L93 Difference]: Finished difference Result 548 states and 712 transitions. [2024-10-24 14:40:26,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:40:26,921 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-24 14:40:26,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:26,923 INFO L225 Difference]: With dead ends: 548 [2024-10-24 14:40:26,923 INFO L226 Difference]: Without dead ends: 432 [2024-10-24 14:40:26,923 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-24 14:40:26,924 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 10 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:40:26,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1444 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 14:40:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-24 14:40:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 430. [2024-10-24 14:40:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 425 states have (on average 1.2823529411764707) internal successors, (545), 425 states have internal predecessors, (545), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:40:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 551 transitions. [2024-10-24 14:40:26,948 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 551 transitions. Word has length 169 [2024-10-24 14:40:26,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:26,949 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 551 transitions. [2024-10-24 14:40:26,949 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-24 14:40:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 551 transitions. [2024-10-24 14:40:26,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 14:40:26,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:26,950 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-24 14:40:26,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 14:40:26,951 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:26,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:26,951 INFO L85 PathProgramCache]: Analyzing trace with hash 406839697, now seen corresponding path program 1 times [2024-10-24 14:40:26,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:26,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971864937] [2024-10-24 14:40:26,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:26,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:27,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:40:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:27,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:40:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 14:40:27,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:27,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971864937] [2024-10-24 14:40:27,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971864937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:27,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:40:27,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 14:40:27,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619380622] [2024-10-24 14:40:27,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:27,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 14:40:27,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:27,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 14:40:27,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 14:40:27,275 INFO L87 Difference]: Start difference. First operand 430 states and 551 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-24 14:40:27,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:27,826 INFO L93 Difference]: Finished difference Result 556 states and 721 transitions. [2024-10-24 14:40:27,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 14:40:27,826 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-24 14:40:27,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:27,829 INFO L225 Difference]: With dead ends: 556 [2024-10-24 14:40:27,829 INFO L226 Difference]: Without dead ends: 437 [2024-10-24 14:40:27,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 14:40:27,830 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 14 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2024-10-24 14:40:27,830 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.5s Time] [2024-10-24 14:40:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-24 14:40:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 434. [2024-10-24 14:40:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 429 states have (on average 1.2820512820512822) internal successors, (550), 429 states have internal predecessors, (550), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:40:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 556 transitions. [2024-10-24 14:40:27,842 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 556 transitions. Word has length 170 [2024-10-24 14:40:27,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:27,842 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 556 transitions. [2024-10-24 14:40:27,842 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-24 14:40:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 556 transitions. [2024-10-24 14:40:27,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 14:40:27,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:27,843 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-24 14:40:27,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 14:40:27,845 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:27,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:27,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1348308363, now seen corresponding path program 1 times [2024-10-24 14:40:27,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:27,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657793687] [2024-10-24 14:40:27,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:27,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:28,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:40:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:28,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:40:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:28,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-24 14:40:28,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:28,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657793687] [2024-10-24 14:40:28,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657793687] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:40:28,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521789022] [2024-10-24 14:40:28,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:28,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:40:28,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:40:28,154 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 14:40:28,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 14:40:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:28,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 14:40:28,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:40:28,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 14:40:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:40:28,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 14:40:28,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521789022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:40:28,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 14:40:28,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2024-10-24 14:40:28,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476572339] [2024-10-24 14:40:28,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:40:28,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 14:40:28,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:40:28,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 14:40:28,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-24 14:40:28,946 INFO L87 Difference]: Start difference. First operand 434 states and 556 transitions. Second operand has 8 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 14:40:29,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:40:29,148 INFO L93 Difference]: Finished difference Result 911 states and 1182 transitions. [2024-10-24 14:40:29,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 14:40:29,149 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 170 [2024-10-24 14:40:29,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:40:29,152 INFO L225 Difference]: With dead ends: 911 [2024-10-24 14:40:29,152 INFO L226 Difference]: Without dead ends: 578 [2024-10-24 14:40:29,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-24 14:40:29,153 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 545 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 14:40:29,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 2054 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 14:40:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-10-24 14:40:29,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 454. [2024-10-24 14:40:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 446 states have (on average 1.2869955156950672) internal successors, (574), 448 states have internal predecessors, (574), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 14:40:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 583 transitions. [2024-10-24 14:40:29,173 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 583 transitions. Word has length 170 [2024-10-24 14:40:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:40:29,174 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 583 transitions. [2024-10-24 14:40:29,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 14:40:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 583 transitions. [2024-10-24 14:40:29,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 14:40:29,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:40:29,176 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-24 14:40:29,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 14:40:29,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-24 14:40:29,381 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:40:29,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:40:29,381 INFO L85 PathProgramCache]: Analyzing trace with hash 420563307, now seen corresponding path program 1 times [2024-10-24 14:40:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:40:29,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899722140] [2024-10-24 14:40:29,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:29,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:40:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:29,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:40:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:29,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 14:40:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:29,784 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-24 14:40:29,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:40:29,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899722140] [2024-10-24 14:40:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899722140] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:40:29,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135760696] [2024-10-24 14:40:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:40:29,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:40:29,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:40:29,786 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 14:40:29,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 14:40:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:40:30,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-10-24 14:40:30,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:40:30,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 14:40:30,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 14:40:30,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 14:40:30,665 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-10-24 14:40:30,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-10-24 14:40:30,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-24 14:40:30,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-24 14:40:30,900 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 14:40:30,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2024-10-24 14:40:30,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-24 14:40:37,540 INFO L224 Elim1Store]: Index analysis took 289 ms