./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/seq-pthread/cs_szymanski.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 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:39:39,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:39:40,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:39:40,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:39:40,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:39:40,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:39:40,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:39:40,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:39:40,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:39:40,049 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:39:40,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:39:40,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:39:40,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:39:40,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:39:40,050 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:39:40,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:39:40,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:39:40,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:39:40,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:39:40,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:39:40,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:39:40,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:39:40,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:39:40,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:39:40,054 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:39:40,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:39:40,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:39:40,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:39:40,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:39:40,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:39:40,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:39:40,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:39:40,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:39:40,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:39:40,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:39:40,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:39:40,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:39:40,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:39:40,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:39:40,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:39:40,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:39:40,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:39:40,060 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 -> 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 [2024-10-12 20:39:40,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:39:40,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:39:40,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:39:40,338 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:39:40,339 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:39:40,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i [2024-10-12 20:39:41,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:39:42,060 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:39:42,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i [2024-10-12 20:39:42,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be349b2be/5d0f8c67647f4df1b61278a2cad2366b/FLAGc0060da2b [2024-10-12 20:39:42,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be349b2be/5d0f8c67647f4df1b61278a2cad2366b [2024-10-12 20:39:42,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:39:42,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:39:42,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:39:42,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:39:42,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:39:42,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:39:42" (1/1) ... [2024-10-12 20:39:42,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382da9ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:42, skipping insertion in model container [2024-10-12 20:39:42,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:39:42" (1/1) ... [2024-10-12 20:39:42,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:39:42,784 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/seq-pthread/cs_szymanski.i[23606,23619] [2024-10-12 20:39:42,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:39:42,950 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:39:42,991 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/seq-pthread/cs_szymanski.i[23606,23619] [2024-10-12 20:39:43,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:39:43,103 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:39:43,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:43 WrapperNode [2024-10-12 20:39:43,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:39:43,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:39:43,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:39:43,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:39:43,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:43" (1/1) ... [2024-10-12 20:39:43,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:43" (1/1) ... [2024-10-12 20:39:43,188 INFO L138 Inliner]: procedures = 145, calls = 289, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 401 [2024-10-12 20:39:43,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:39:43,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:39:43,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:39:43,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:39:43,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:43" (1/1) ... [2024-10-12 20:39:43,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:43" (1/1) ... [2024-10-12 20:39:43,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:43" (1/1) ... [2024-10-12 20:39:43,260 INFO L175 MemorySlicer]: Split 136 memory accesses to 15 slices as follows [2, 8, 8, 29, 21, 7, 5, 7, 7, 5, 6, 0, 13, 5, 13]. 21 percent of accesses are in the largest equivalence class. The 37 initializations are split as follows [2, 3, 3, 9, 9, 3, 0, 3, 3, 0, 2, 0, 0, 0, 0]. The 34 writes are split as follows [0, 2, 2, 11, 6, 2, 1, 2, 2, 1, 2, 0, 1, 1, 1]. [2024-10-12 20:39:43,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:43" (1/1) ... [2024-10-12 20:39:43,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:43" (1/1) ... [2024-10-12 20:39:43,321 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:43" (1/1) ... [2024-10-12 20:39:43,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:43" (1/1) ... [2024-10-12 20:39:43,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:43" (1/1) ... [2024-10-12 20:39:43,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:43" (1/1) ... [2024-10-12 20:39:43,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:39:43,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:39:43,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:39:43,403 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:39:43,407 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:43" (1/1) ... [2024-10-12 20:39:43,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:39:43,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:43,459 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-12 20:39:43,462 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-12 20:39:43,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 20:39:43,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 20:39:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 20:39:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 20:39:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-12 20:39:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-12 20:39:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-12 20:39:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-12 20:39:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-12 20:39:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-12 20:39:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-12 20:39:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-12 20:39:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-12 20:39:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-12 20:39:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-12 20:39:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 20:39:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 20:39:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 20:39:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 20:39:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-12 20:39:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-12 20:39:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-12 20:39:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-12 20:39:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-12 20:39:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-12 20:39:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-12 20:39:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-12 20:39:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-12 20:39:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-12 20:39:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-12 20:39:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 20:39:43,524 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 20:39:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:39:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 20:39:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 20:39:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 20:39:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 20:39:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-12 20:39:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-12 20:39:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-12 20:39:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-12 20:39:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-12 20:39:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-12 20:39:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-12 20:39:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-12 20:39:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-12 20:39:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-12 20:39:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-12 20:39:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-12 20:39:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-10-12 20:39:43,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-10-12 20:39:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 20:39:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 20:39:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 20:39:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-12 20:39:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-12 20:39:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-12 20:39:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-12 20:39:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-12 20:39:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-12 20:39:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-12 20:39:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-12 20:39:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-12 20:39:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-12 20:39:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-12 20:39:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-12 20:39:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-10-12 20:39:43,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-10-12 20:39:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-12 20:39:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-12 20:39:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 20:39:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 20:39:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 20:39:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-12 20:39:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-12 20:39:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-12 20:39:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-12 20:39:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-12 20:39:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-12 20:39:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-12 20:39:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-12 20:39:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-12 20:39:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-12 20:39:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-12 20:39:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-12 20:39:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-12 20:39:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-10-12 20:39:43,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-10-12 20:39:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:39:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 20:39:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 20:39:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 20:39:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 20:39:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 20:39:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 20:39:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 20:39:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 20:39:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 20:39:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 20:39:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 20:39:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 20:39:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 20:39:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 20:39:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:39:43,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:39:43,779 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:39:43,781 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:39:46,210 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-12 20:39:46,210 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:39:46,260 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:39:46,260 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 20:39:46,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:39:46 BoogieIcfgContainer [2024-10-12 20:39:46,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:39:46,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:39:46,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:39:46,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:39:46,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:39:42" (1/3) ... [2024-10-12 20:39:46,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32385841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:39:46, skipping insertion in model container [2024-10-12 20:39:46,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:43" (2/3) ... [2024-10-12 20:39:46,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32385841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:39:46, skipping insertion in model container [2024-10-12 20:39:46,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:39:46" (3/3) ... [2024-10-12 20:39:46,271 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_szymanski.i [2024-10-12 20:39:46,289 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:39:46,290 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:39:46,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:39:46,385 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;@653dbb49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:39:46,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:39:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 64 states have (on average 1.359375) internal successors, (87), 65 states have internal predecessors, (87), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-12 20:39:46,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-12 20:39:46,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:46,412 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:39:46,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:46,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:46,420 INFO L85 PathProgramCache]: Analyzing trace with hash -779932173, now seen corresponding path program 1 times [2024-10-12 20:39:46,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:46,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160206422] [2024-10-12 20:39:46,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:46,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:39:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:39:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:39:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 20:39:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 20:39:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 20:39:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:39:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 20:39:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 20:39:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 20:39:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:39:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 20:39:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 20:39:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 20:39:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:39:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 20:39:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 20:39:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 20:39:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-12 20:39:47,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:47,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160206422] [2024-10-12 20:39:47,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160206422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:47,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:47,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:39:47,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185065943] [2024-10-12 20:39:47,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:47,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:39:47,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:47,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:39:47,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:39:47,259 INFO L87 Difference]: Start difference. First operand has 103 states, 64 states have (on average 1.359375) internal successors, (87), 65 states have internal predecessors, (87), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-12 20:39:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:47,391 INFO L93 Difference]: Finished difference Result 208 states and 338 transitions. [2024-10-12 20:39:47,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:39:47,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-10-12 20:39:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:47,405 INFO L225 Difference]: With dead ends: 208 [2024-10-12 20:39:47,405 INFO L226 Difference]: Without dead ends: 104 [2024-10-12 20:39:47,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-12 20:39:47,417 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 3 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:47,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 279 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:39:47,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-12 20:39:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2024-10-12 20:39:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-12 20:39:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2024-10-12 20:39:47,460 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 119 [2024-10-12 20:39:47,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:47,460 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2024-10-12 20:39:47,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-12 20:39:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2024-10-12 20:39:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 20:39:47,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:47,465 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:39:47,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:39:47,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:47,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash 576687601, now seen corresponding path program 1 times [2024-10-12 20:39:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:47,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520998717] [2024-10-12 20:39:47,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:47,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:39:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:39:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 20:39:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 20:39:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 20:39:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 20:39:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:39:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 20:39:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 20:39:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 20:39:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 20:39:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 20:39:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 20:39:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 20:39:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 20:39:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 20:39:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 20:39:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 20:39:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-12 20:39:47,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:47,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520998717] [2024-10-12 20:39:47,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520998717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:47,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:47,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:39:47,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486259845] [2024-10-12 20:39:47,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:47,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:39:47,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:47,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:39:47,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:39:47,878 INFO L87 Difference]: Start difference. First operand 102 states and 146 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-12 20:39:47,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:47,934 INFO L93 Difference]: Finished difference Result 203 states and 292 transitions. [2024-10-12 20:39:47,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:39:47,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 122 [2024-10-12 20:39:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:47,936 INFO L225 Difference]: With dead ends: 203 [2024-10-12 20:39:47,937 INFO L226 Difference]: Without dead ends: 103 [2024-10-12 20:39:47,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-12 20:39:47,939 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:47,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:39:47,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-12 20:39:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-12 20:39:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 65 states have internal predecessors, (83), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-12 20:39:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 147 transitions. [2024-10-12 20:39:47,953 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 147 transitions. Word has length 122 [2024-10-12 20:39:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:47,953 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 147 transitions. [2024-10-12 20:39:47,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-12 20:39:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 147 transitions. [2024-10-12 20:39:47,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-12 20:39:47,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:47,957 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:39:47,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:39:47,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:47,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:47,957 INFO L85 PathProgramCache]: Analyzing trace with hash -593868596, now seen corresponding path program 1 times [2024-10-12 20:39:47,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:47,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723394278] [2024-10-12 20:39:47,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:47,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 20:39:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:39:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:39:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:39:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:39:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:39:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:39:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 20:39:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 20:39:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 20:39:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 20:39:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 20:39:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 20:39:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 20:39:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 20:39:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 20:39:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:39:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 20:39:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-12 20:39:48,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:48,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723394278] [2024-10-12 20:39:48,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723394278] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:39:48,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635123513] [2024-10-12 20:39:48,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:48,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:48,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:48,314 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-12 20:39:48,317 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-12 20:39:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 20:39:48,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:39:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-12 20:39:48,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:39:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-12 20:39:48,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635123513] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:39:48,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:39:48,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-12 20:39:48,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055908716] [2024-10-12 20:39:48,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:39:48,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:39:48,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:48,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:39:48,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:39:48,945 INFO L87 Difference]: Start difference. First operand 103 states and 147 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-12 20:39:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:49,012 INFO L93 Difference]: Finished difference Result 206 states and 296 transitions. [2024-10-12 20:39:49,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:39:49,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 123 [2024-10-12 20:39:49,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:49,015 INFO L225 Difference]: With dead ends: 206 [2024-10-12 20:39:49,015 INFO L226 Difference]: Without dead ends: 105 [2024-10-12 20:39:49,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:39:49,017 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:49,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 558 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:39:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-12 20:39:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-12 20:39:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-12 20:39:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 149 transitions. [2024-10-12 20:39:49,034 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 149 transitions. Word has length 123 [2024-10-12 20:39:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:49,035 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 149 transitions. [2024-10-12 20:39:49,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-12 20:39:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 149 transitions. [2024-10-12 20:39:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 20:39:49,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:49,037 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:49,057 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-12 20:39:49,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:49,238 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:49,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:49,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2144446100, now seen corresponding path program 2 times [2024-10-12 20:39:49,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:49,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686848170] [2024-10-12 20:39:49,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:49,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:39:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:39:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 20:39:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 20:39:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 20:39:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:39:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 20:39:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 20:39:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 20:39:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:39:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 20:39:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 20:39:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 20:39:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:39:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 20:39:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 20:39:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 20:39:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:39:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-10-12 20:39:49,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:49,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686848170] [2024-10-12 20:39:49,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686848170] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:39:49,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694160426] [2024-10-12 20:39:49,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 20:39:49,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:49,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:49,530 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-12 20:39:49,532 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-12 20:39:49,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 20:39:49,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 20:39:49,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 20:39:49,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:39:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2024-10-12 20:39:50,137 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:39:50,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694160426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:50,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:39:50,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 20:39:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394048535] [2024-10-12 20:39:50,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:50,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:39:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:50,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:39:50,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:39:50,142 INFO L87 Difference]: Start difference. First operand 105 states and 149 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-12 20:39:50,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:50,220 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2024-10-12 20:39:50,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:39:50,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-10-12 20:39:50,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:50,226 INFO L225 Difference]: With dead ends: 199 [2024-10-12 20:39:50,226 INFO L226 Difference]: Without dead ends: 157 [2024-10-12 20:39:50,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:39:50,228 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 72 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:50,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 440 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:39:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-12 20:39:50,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-10-12 20:39:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.306930693069307) internal successors, (132), 101 states have internal predecessors, (132), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2024-10-12 20:39:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 226 transitions. [2024-10-12 20:39:50,261 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 226 transitions. Word has length 125 [2024-10-12 20:39:50,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:50,261 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 226 transitions. [2024-10-12 20:39:50,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-12 20:39:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 226 transitions. [2024-10-12 20:39:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-12 20:39:50,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:50,267 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:50,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 20:39:50,468 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,SelfDestructingSolverStorable3 [2024-10-12 20:39:50,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:50,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:50,470 INFO L85 PathProgramCache]: Analyzing trace with hash 852698505, now seen corresponding path program 1 times [2024-10-12 20:39:50,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:50,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23553872] [2024-10-12 20:39:50,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:50,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:39:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:39:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:39:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 20:39:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 20:39:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:39:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:39:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 20:39:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 20:39:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 20:39:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 20:39:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 20:39:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:39:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 20:39:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-12 20:39:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:51,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 20:39:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:51,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 20:39:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:51,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-12 20:39:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:51,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-12 20:39:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:51,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-12 20:39:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:51,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-12 20:39:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:51,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-12 20:39:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:51,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-12 20:39:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:51,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-12 20:39:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:51,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-12 20:39:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2024-10-12 20:39:51,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:51,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23553872] [2024-10-12 20:39:51,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23553872] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:39:51,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419526089] [2024-10-12 20:39:51,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:51,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:51,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:51,031 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-12 20:39:51,033 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-12 20:39:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:51,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 20:39:51,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:39:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2024-10-12 20:39:51,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:39:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2024-10-12 20:39:51,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419526089] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:39:51,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:39:51,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 4] total 10 [2024-10-12 20:39:51,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109801828] [2024-10-12 20:39:51,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:39:51,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 20:39:51,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:51,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 20:39:51,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-12 20:39:51,792 INFO L87 Difference]: Start difference. First operand 157 states and 226 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (62), 6 states have call predecessors, (62), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-10-12 20:39:55,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:59,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:40:00,458 INFO L93 Difference]: Finished difference Result 326 states and 470 transitions. [2024-10-12 20:40:00,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:40:00,459 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (62), 6 states have call predecessors, (62), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 189 [2024-10-12 20:40:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:40:00,461 INFO L225 Difference]: With dead ends: 326 [2024-10-12 20:40:00,461 INFO L226 Difference]: Without dead ends: 177 [2024-10-12 20:40:00,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 431 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:40:00,463 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 59 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 97 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:40:00,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 477 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 404 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2024-10-12 20:40:00,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-12 20:40:00,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2024-10-12 20:40:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 117 states have internal predecessors, (148), 45 states have call successors, (45), 10 states have call predecessors, (45), 12 states have return successors, (53), 45 states have call predecessors, (53), 45 states have call successors, (53) [2024-10-12 20:40:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 246 transitions. [2024-10-12 20:40:00,495 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 246 transitions. Word has length 189 [2024-10-12 20:40:00,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:40:00,495 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 246 transitions. [2024-10-12 20:40:00,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (62), 6 states have call predecessors, (62), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-10-12 20:40:00,495 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 246 transitions. [2024-10-12 20:40:00,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-12 20:40:00,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:40:00,498 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:40:00,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 20:40:00,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:40:00,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:40:00,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:40:00,699 INFO L85 PathProgramCache]: Analyzing trace with hash 546297731, now seen corresponding path program 2 times [2024-10-12 20:40:00,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:40:00,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142759564] [2024-10-12 20:40:00,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:40:00,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:40:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 20:40:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:40:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:40:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 20:40:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 20:40:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:40:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:40:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 20:40:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 20:40:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 20:40:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:40:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 20:40:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-12 20:40:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 20:40:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 20:40:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-12 20:40:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-12 20:40:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-12 20:40:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-12 20:40:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-12 20:40:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-12 20:40:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-12 20:40:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-12 20:40:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-12 20:40:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-12 20:40:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-10-12 20:40:01,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:40:01,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142759564] [2024-10-12 20:40:01,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142759564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:40:01,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:40:01,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:40:01,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497872070] [2024-10-12 20:40:01,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:40:01,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:40:01,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:40:01,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:40:01,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:40:01,784 INFO L87 Difference]: Start difference. First operand 173 states and 246 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-12 20:40:05,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:09,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:13,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:17,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:22,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:40:23,318 INFO L93 Difference]: Finished difference Result 459 states and 661 transitions. [2024-10-12 20:40:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:40:23,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 201 [2024-10-12 20:40:23,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:40:23,321 INFO L225 Difference]: With dead ends: 459 [2024-10-12 20:40:23,322 INFO L226 Difference]: Without dead ends: 323 [2024-10-12 20:40:23,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:40:23,323 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 179 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 122 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:40:23,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 569 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 556 Invalid, 5 Unknown, 0 Unchecked, 21.2s Time] [2024-10-12 20:40:23,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-12 20:40:23,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 313. [2024-10-12 20:40:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 200 states have (on average 1.285) internal successors, (257), 205 states have internal predecessors, (257), 87 states have call successors, (87), 20 states have call predecessors, (87), 25 states have return successors, (110), 87 states have call predecessors, (110), 87 states have call successors, (110) [2024-10-12 20:40:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 454 transitions. [2024-10-12 20:40:23,364 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 454 transitions. Word has length 201 [2024-10-12 20:40:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:40:23,364 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 454 transitions. [2024-10-12 20:40:23,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-12 20:40:23,365 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 454 transitions. [2024-10-12 20:40:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-12 20:40:23,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:40:23,369 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:40:23,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:40:23,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:40:23,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:40:23,370 INFO L85 PathProgramCache]: Analyzing trace with hash -916485789, now seen corresponding path program 1 times [2024-10-12 20:40:23,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:40:23,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694759570] [2024-10-12 20:40:23,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:40:23,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:40:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 20:40:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:40:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:40:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 20:40:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 20:40:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:40:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:40:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 20:40:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 20:40:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 20:40:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:40:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 20:40:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-12 20:40:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 20:40:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 20:40:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-12 20:40:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-12 20:40:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-12 20:40:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-12 20:40:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-12 20:40:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-12 20:40:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-12 20:40:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-12 20:40:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-12 20:40:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-12 20:40:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-10-12 20:40:24,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:40:24,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694759570] [2024-10-12 20:40:24,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694759570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:40:24,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:40:24,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:40:24,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945409647] [2024-10-12 20:40:24,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:40:24,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:40:24,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:40:24,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:40:24,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:40:24,370 INFO L87 Difference]: Start difference. First operand 313 states and 454 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-12 20:40:28,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:32,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:36,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:40,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:44,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:45,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:40:45,883 INFO L93 Difference]: Finished difference Result 573 states and 817 transitions. [2024-10-12 20:40:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:40:45,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 201 [2024-10-12 20:40:45,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:40:45,887 INFO L225 Difference]: With dead ends: 573 [2024-10-12 20:40:45,888 INFO L226 Difference]: Without dead ends: 290 [2024-10-12 20:40:45,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:40:45,891 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 175 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 123 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:40:45,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 568 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 546 Invalid, 5 Unknown, 0 Unchecked, 21.2s Time] [2024-10-12 20:40:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-12 20:40:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 282. [2024-10-12 20:40:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 181 states have (on average 1.2430939226519337) internal successors, (225), 185 states have internal predecessors, (225), 78 states have call successors, (78), 18 states have call predecessors, (78), 22 states have return successors, (92), 78 states have call predecessors, (92), 78 states have call successors, (92) [2024-10-12 20:40:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 395 transitions. [2024-10-12 20:40:45,933 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 395 transitions. Word has length 201 [2024-10-12 20:40:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:40:45,934 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 395 transitions. [2024-10-12 20:40:45,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-12 20:40:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 395 transitions. [2024-10-12 20:40:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-12 20:40:45,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:40:45,937 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:40:45,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:40:45,938 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:40:45,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:40:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash 567442243, now seen corresponding path program 1 times [2024-10-12 20:40:45,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:40:45,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059393298] [2024-10-12 20:40:45,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:40:45,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:40:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:46,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:40:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:46,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:46,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:46,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:40:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:46,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:40:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:46,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:46,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 20:40:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:46,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 20:40:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:46,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:46,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:40:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:46,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:40:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 20:40:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 20:40:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 20:40:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:40:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 20:40:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-12 20:40:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 20:40:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 20:40:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-12 20:40:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-12 20:40:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-12 20:40:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-12 20:40:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-12 20:40:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-12 20:40:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-12 20:40:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-12 20:40:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-12 20:40:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-12 20:40:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2024-10-12 20:40:47,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:40:47,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059393298] [2024-10-12 20:40:47,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059393298] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:40:47,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712423592] [2024-10-12 20:40:47,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:40:47,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:40:47,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:40:47,085 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-12 20:40:47,086 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-12 20:40:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:48,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 1591 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 20:40:48,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:40:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 288 proven. 4 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2024-10-12 20:40:48,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:40:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2024-10-12 20:40:48,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712423592] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:40:48,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:40:48,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 16 [2024-10-12 20:40:48,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932612353] [2024-10-12 20:40:48,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:40:48,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 20:40:48,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:40:48,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 20:40:48,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:40:48,584 INFO L87 Difference]: Start difference. First operand 282 states and 395 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 12 states have internal predecessors, (84), 9 states have call successors, (56), 8 states have call predecessors, (56), 7 states have return successors, (55), 7 states have call predecessors, (55), 9 states have call successors, (55) [2024-10-12 20:40:52,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:56,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:40:58,362 INFO L93 Difference]: Finished difference Result 560 states and 804 transitions. [2024-10-12 20:40:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 20:40:58,363 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 12 states have internal predecessors, (84), 9 states have call successors, (56), 8 states have call predecessors, (56), 7 states have return successors, (55), 7 states have call predecessors, (55), 9 states have call successors, (55) Word has length 201 [2024-10-12 20:40:58,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:40:58,368 INFO L225 Difference]: With dead ends: 560 [2024-10-12 20:40:58,368 INFO L226 Difference]: Without dead ends: 305 [2024-10-12 20:40:58,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2024-10-12 20:40:58,371 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 288 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 225 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:40:58,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 552 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 639 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2024-10-12 20:40:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-12 20:40:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 299. [2024-10-12 20:40:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 195 states have (on average 1.2717948717948717) internal successors, (248), 199 states have internal predecessors, (248), 73 states have call successors, (73), 26 states have call predecessors, (73), 30 states have return successors, (97), 73 states have call predecessors, (97), 73 states have call successors, (97) [2024-10-12 20:40:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 418 transitions. [2024-10-12 20:40:58,405 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 418 transitions. Word has length 201 [2024-10-12 20:40:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:40:58,406 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 418 transitions. [2024-10-12 20:40:58,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 12 states have internal predecessors, (84), 9 states have call successors, (56), 8 states have call predecessors, (56), 7 states have return successors, (55), 7 states have call predecessors, (55), 9 states have call successors, (55) [2024-10-12 20:40:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 418 transitions. [2024-10-12 20:40:58,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-12 20:40:58,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:40:58,409 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:40:58,448 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-12 20:40:58,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:40:58,611 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:40:58,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:40:58,611 INFO L85 PathProgramCache]: Analyzing trace with hash -201251771, now seen corresponding path program 1 times [2024-10-12 20:40:58,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:40:58,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966097025] [2024-10-12 20:40:58,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:40:58,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:40:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:00,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:41:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:00,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:41:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:00,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:41:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:00,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:41:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:41:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:41:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 20:41:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 20:41:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:41:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:41:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:41:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:41:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 20:41:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 20:41:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 20:41:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:41:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 20:41:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-12 20:41:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 20:41:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 20:41:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-12 20:41:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-12 20:41:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-12 20:41:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-12 20:41:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-12 20:41:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-12 20:41:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-12 20:41:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-12 20:41:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-12 20:41:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-12 20:41:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2024-10-12 20:41:01,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:41:01,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966097025] [2024-10-12 20:41:01,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966097025] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:41:01,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781716789] [2024-10-12 20:41:01,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:41:01,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:41:01,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:41:01,382 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-12 20:41:01,383 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-12 20:41:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:41:02,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 1677 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-12 20:41:02,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:41:02,270 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 13 treesize of output 9 [2024-10-12 20:41:08,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 20:41:08,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 20:41:08,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2024-10-12 20:41:10,958 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-12 20:41:10,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24