./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stack-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-pthread/cs_stack-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:52:28,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:52:28,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:52:28,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:52:28,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:52:28,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:52:28,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:52:28,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:52:28,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:52:28,228 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:52:28,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:52:28,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:52:28,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:52:28,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:52:28,229 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:52:28,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:52:28,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:52:28,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:52:28,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:52:28,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:52:28,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:52:28,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:52:28,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:52:28,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:52:28,234 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:52:28,234 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:52:28,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:52:28,234 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:52:28,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:52:28,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:52:28,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:52:28,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:52:28,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:52:28,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:52:28,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:52:28,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:52:28,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:52:28,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:52:28,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:52:28,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:52:28,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:52:28,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:52:28,239 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 -> f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 [2024-11-11 21:52:28,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:52:28,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:52:28,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:52:28,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:52:28,547 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:52:28,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stack-1.i [2024-11-11 21:52:29,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:52:30,239 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:52:30,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-1.i [2024-11-11 21:52:30,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88eca8679/c30f4de5cc03445cb82fa4ffc7baa318/FLAG66dda5089 [2024-11-11 21:52:30,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88eca8679/c30f4de5cc03445cb82fa4ffc7baa318 [2024-11-11 21:52:30,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:52:30,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:52:30,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:52:30,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:52:30,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:52:30,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:52:30" (1/1) ... [2024-11-11 21:52:30,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd82e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:52:30, skipping insertion in model container [2024-11-11 21:52:30,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:52:30" (1/1) ... [2024-11-11 21:52:30,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:52:30,796 WARN L250 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_stack-1.i[34744,34757] [2024-11-11 21:52:30,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:52:30,948 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:52:30,986 WARN L250 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_stack-1.i[34744,34757] [2024-11-11 21:52:31,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:52:31,098 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:52:31,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:52:31 WrapperNode [2024-11-11 21:52:31,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:52:31,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:52:31,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:52:31,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:52:31,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:52:31" (1/1) ... [2024-11-11 21:52:31,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:52:31" (1/1) ... [2024-11-11 21:52:31,197 INFO L138 Inliner]: procedures = 254, calls = 303, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 696 [2024-11-11 21:52:31,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:52:31,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:52:31,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:52:31,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:52:31,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:52:31" (1/1) ... [2024-11-11 21:52:31,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:52:31" (1/1) ... [2024-11-11 21:52:31,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:52:31" (1/1) ... [2024-11-11 21:52:31,277 INFO L175 MemorySlicer]: Split 156 memory accesses to 18 slices as follows [0, 2, 7, 8, 8, 8, 8, 20, 22, 12, 12, 4, 5, 21, 3, 7, 3, 6]. 14 percent of accesses are in the largest equivalence class. The 53 initializations are split as follows [0, 2, 0, 3, 3, 2, 3, 6, 10, 6, 2, 2, 2, 10, 0, 0, 0, 2]. The 38 writes are split as follows [0, 0, 1, 2, 2, 3, 2, 8, 6, 3, 3, 1, 1, 1, 1, 1, 1, 2]. [2024-11-11 21:52:31,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:52:31" (1/1) ... [2024-11-11 21:52:31,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:52:31" (1/1) ... [2024-11-11 21:52:31,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:52:31" (1/1) ... [2024-11-11 21:52:31,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:52:31" (1/1) ... [2024-11-11 21:52:31,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:52:31" (1/1) ... [2024-11-11 21:52:31,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:52:31" (1/1) ... [2024-11-11 21:52:31,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:52:31,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:52:31,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:52:31,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:52:31,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:52:31" (1/1) ... [2024-11-11 21:52:31,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:52:31,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:52:31,422 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-11-11 21:52:31,425 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-11-11 21:52:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-11 21:52:31,470 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-11 21:52:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 21:52:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-11-11 21:52:31,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-11-11 21:52:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-11 21:52:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-11 21:52:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-11 21:52:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-11 21:52:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-11 21:52:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-11 21:52:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-11 21:52:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-11 21:52:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-11 21:52:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-11 21:52:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-11 21:52:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-11 21:52:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-11 21:52:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-11 21:52:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-11 21:52:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-11-11 21:52:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-11-11 21:52:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-11-11 21:52:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 21:52:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-11 21:52:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-11 21:52:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-11 21:52:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-11 21:52:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-11 21:52:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-11 21:52:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-11 21:52:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-11 21:52:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-11 21:52:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-11 21:52:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-11 21:52:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-11 21:52:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-11 21:52:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-11 21:52:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-11-11 21:52:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-11-11 21:52:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-11-11 21:52:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-11-11 21:52:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-11-11 21:52:31,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-11-11 21:52:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 21:52:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 21:52:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-11 21:52:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-11 21:52:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-11 21:52:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-11 21:52:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-11 21:52:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-11 21:52:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-11 21:52:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-11 21:52:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-11 21:52:31,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-11 21:52:31,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-11 21:52:31,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-11 21:52:31,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-11 21:52:31,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-11 21:52:31,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-11-11 21:52:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-11-11 21:52:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 21:52:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 21:52:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-11 21:52:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-11 21:52:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-11 21:52:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-11 21:52:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-11 21:52:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-11 21:52:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-11 21:52:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-11 21:52:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-11 21:52:31,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-11 21:52:31,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-11 21:52:31,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-11 21:52:31,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-11 21:52:31,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-11 21:52:31,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-11-11 21:52:31,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-11-11 21:52:31,484 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2024-11-11 21:52:31,484 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2024-11-11 21:52:31,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:52:31,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-11 21:52:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-11 21:52:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-11 21:52:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-11 21:52:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-11 21:52:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-11 21:52:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-11 21:52:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-11 21:52:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-11 21:52:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-11 21:52:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-11 21:52:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-11 21:52:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-11 21:52:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-11 21:52:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-11 21:52:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-11-11 21:52:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-11-11 21:52:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-11-11 21:52:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-11-11 21:52:31,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-11-11 21:52:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-11-11 21:52:31,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-11-11 21:52:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-11 21:52:31,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-11 21:52:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-11 21:52:31,488 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-11 21:52:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-11-11 21:52:31,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-11-11 21:52:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:52:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 21:52:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 21:52:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 21:52:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-11 21:52:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-11 21:52:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-11 21:52:31,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-11 21:52:31,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-11 21:52:31,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-11 21:52:31,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-11 21:52:31,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-11 21:52:31,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-11 21:52:31,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-11 21:52:31,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-11 21:52:31,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-11 21:52:31,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-11 21:52:31,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-11 21:52:31,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:52:31,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:52:31,835 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:52:31,838 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:52:31,889 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-11 21:52:31,889 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2024-11-11 21:52:32,344 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-11 21:52:32,345 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2024-11-11 21:52:32,345 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-11 21:52:32,345 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2024-11-11 21:52:32,346 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-11 21:52:32,346 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2024-11-11 21:52:32,346 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-11 21:52:32,346 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##42: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2024-11-11 21:52:32,346 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2024-11-11 21:52:32,346 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));pop_#res#1 := 0; [2024-11-11 21:52:32,347 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-2: SUMMARY for call __CS_cs(); srcloc: null [2024-11-11 21:52:32,347 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2024-11-11 21:52:32,347 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-11 21:52:32,366 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-11 21:52:32,366 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2024-11-11 21:52:32,366 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2024-11-11 21:52:32,366 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-11 21:52:32,366 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-11 21:52:32,366 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L933: SUMMARY for call __CS_cs(); srcloc: null [2024-11-11 21:52:32,366 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2024-11-11 21:52:32,366 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-11 21:52:32,366 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2024-11-11 21:52:36,739 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2024-11-11 21:52:36,739 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:52:36,763 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:52:36,766 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-11 21:52:36,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:52:36 BoogieIcfgContainer [2024-11-11 21:52:36,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:52:36,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:52:36,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:52:36,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:52:36,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:52:30" (1/3) ... [2024-11-11 21:52:36,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dab1c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:52:36, skipping insertion in model container [2024-11-11 21:52:36,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:52:31" (2/3) ... [2024-11-11 21:52:36,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dab1c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:52:36, skipping insertion in model container [2024-11-11 21:52:36,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:52:36" (3/3) ... [2024-11-11 21:52:36,776 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stack-1.i [2024-11-11 21:52:36,794 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:52:36,795 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:52:36,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:52:36,887 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;@4d7fe8b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:52:36,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:52:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 224 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 143 states have internal predecessors, (214), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-11 21:52:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-11 21:52:36,925 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:52:36,926 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 21:52:36,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:52:36,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:52:36,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2105473957, now seen corresponding path program 1 times [2024-11-11 21:52:36,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:52:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559334384] [2024-11-11 21:52:36,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:36,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:52:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:52:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 21:52:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 21:52:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 21:52:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:52:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:52:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:52:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:52:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 21:52:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 21:52:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:52:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 21:52:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 21:52:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 21:52:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-11 21:52:37,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:52:37,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559334384] [2024-11-11 21:52:37,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559334384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:52:37,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:52:37,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:52:37,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496147582] [2024-11-11 21:52:37,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:52:37,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:52:37,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:52:37,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:52:37,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:52:37,942 INFO L87 Difference]: Start difference. First operand has 224 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 143 states have internal predecessors, (214), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-11 21:52:38,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:52:38,054 INFO L93 Difference]: Finished difference Result 453 states and 798 transitions. [2024-11-11 21:52:38,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:52:38,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2024-11-11 21:52:38,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:52:38,073 INFO L225 Difference]: With dead ends: 453 [2024-11-11 21:52:38,074 INFO L226 Difference]: Without dead ends: 227 [2024-11-11 21:52:38,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-11-11 21:52:38,084 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 8 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:52:38,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 695 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:52:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-11 21:52:38,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 221. [2024-11-11 21:52:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 138 states have (on average 1.4782608695652173) internal successors, (204), 140 states have internal predecessors, (204), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-11 21:52:38,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 350 transitions. [2024-11-11 21:52:38,153 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 350 transitions. Word has length 96 [2024-11-11 21:52:38,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:52:38,153 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 350 transitions. [2024-11-11 21:52:38,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-11 21:52:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 350 transitions. [2024-11-11 21:52:38,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 21:52:38,163 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:52:38,165 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 21:52:38,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:52:38,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:52:38,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:52:38,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1809952576, now seen corresponding path program 1 times [2024-11-11 21:52:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:52:38,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141964211] [2024-11-11 21:52:38,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:38,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:52:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:52:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 21:52:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 21:52:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 21:52:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 21:52:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 21:52:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:52:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:52:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 21:52:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 21:52:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:52:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 21:52:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 21:52:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 21:52:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-11 21:52:38,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:52:38,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141964211] [2024-11-11 21:52:38,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141964211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:52:38,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:52:38,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:52:38,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990133925] [2024-11-11 21:52:38,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:52:38,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:52:38,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:52:38,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:52:38,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:52:38,539 INFO L87 Difference]: Start difference. First operand 221 states and 350 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-11 21:52:38,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:52:38,598 INFO L93 Difference]: Finished difference Result 443 states and 703 transitions. [2024-11-11 21:52:38,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:52:38,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 101 [2024-11-11 21:52:38,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:52:38,604 INFO L225 Difference]: With dead ends: 443 [2024-11-11 21:52:38,604 INFO L226 Difference]: Without dead ends: 225 [2024-11-11 21:52:38,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-11-11 21:52:38,609 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 2 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:52:38,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 685 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:52:38,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-11 21:52:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-11-11 21:52:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 140 states have (on average 1.4714285714285715) internal successors, (206), 142 states have internal predecessors, (206), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-11 21:52:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 352 transitions. [2024-11-11 21:52:38,645 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 352 transitions. Word has length 101 [2024-11-11 21:52:38,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:52:38,646 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 352 transitions. [2024-11-11 21:52:38,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-11 21:52:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 352 transitions. [2024-11-11 21:52:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-11 21:52:38,650 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:52:38,650 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 21:52:38,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:52:38,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:52:38,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:52:38,651 INFO L85 PathProgramCache]: Analyzing trace with hash 873048004, now seen corresponding path program 1 times [2024-11-11 21:52:38,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:52:38,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430729635] [2024-11-11 21:52:38,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:38,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:52:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:52:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:52:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 21:52:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 21:52:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:52:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:52:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 21:52:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:52:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:52:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 21:52:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 21:52:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:39,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 21:52:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:39,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 21:52:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:39,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:52:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-11-11 21:52:39,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:52:39,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430729635] [2024-11-11 21:52:39,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430729635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:52:39,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038202061] [2024-11-11 21:52:39,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:39,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:52:39,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:52:39,024 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-11-11 21:52:39,026 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-11-11 21:52:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:39,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:52:39,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:52:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-11-11 21:52:39,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:52:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-11-11 21:52:39,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038202061] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:52:39,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:52:39,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-11 21:52:39,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524105621] [2024-11-11 21:52:39,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:52:39,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:52:39,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:52:39,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:52:39,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:52:39,617 INFO L87 Difference]: Start difference. First operand 223 states and 352 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-11 21:52:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:52:39,701 INFO L93 Difference]: Finished difference Result 452 states and 714 transitions. [2024-11-11 21:52:39,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:52:39,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 105 [2024-11-11 21:52:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:52:39,707 INFO L225 Difference]: With dead ends: 452 [2024-11-11 21:52:39,709 INFO L226 Difference]: Without dead ends: 232 [2024-11-11 21:52:39,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 235 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-11-11 21:52:39,711 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 4 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:52:39,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1365 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:52:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-11 21:52:39,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2024-11-11 21:52:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 148 states have (on average 1.445945945945946) internal successors, (214), 150 states have internal predecessors, (214), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-11 21:52:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 360 transitions. [2024-11-11 21:52:39,742 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 360 transitions. Word has length 105 [2024-11-11 21:52:39,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:52:39,743 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 360 transitions. [2024-11-11 21:52:39,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-11 21:52:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 360 transitions. [2024-11-11 21:52:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 21:52:39,749 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:52:39,749 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:52:39,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:52:39,953 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-11-11 21:52:39,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:52:39,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:52:39,955 INFO L85 PathProgramCache]: Analyzing trace with hash -410837044, now seen corresponding path program 2 times [2024-11-11 21:52:39,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:52:39,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419513687] [2024-11-11 21:52:39,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:39,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:52:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 21:52:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 21:52:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 21:52:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 21:52:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:52:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:52:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 21:52:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 21:52:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:52:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 21:52:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 21:52:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 21:52:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 21:52:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 21:52:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-11-11 21:52:40,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:52:40,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419513687] [2024-11-11 21:52:40,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419513687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:52:40,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180629695] [2024-11-11 21:52:40,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 21:52:40,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:52:40,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:52:40,295 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-11-11 21:52:40,296 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-11-11 21:52:40,704 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-11 21:52:40,705 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:52:40,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 21:52:40,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:52:40,899 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2024-11-11 21:52:40,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:52:40,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180629695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:52:40,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:52:40,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 21:52:40,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946444090] [2024-11-11 21:52:40,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:52:40,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:52:40,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:52:40,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:52:40,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:52:40,904 INFO L87 Difference]: Start difference. First operand 231 states and 360 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-11 21:52:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:52:40,954 INFO L93 Difference]: Finished difference Result 439 states and 701 transitions. [2024-11-11 21:52:40,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:52:40,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-11 21:52:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:52:40,959 INFO L225 Difference]: With dead ends: 439 [2024-11-11 21:52:40,960 INFO L226 Difference]: Without dead ends: 405 [2024-11-11 21:52:40,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 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-11-11 21:52:40,961 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 280 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:52:40,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1076 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:52:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-11 21:52:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 404. [2024-11-11 21:52:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 254 states have (on average 1.4960629921259843) internal successors, (380), 258 states have internal predecessors, (380), 131 states have call successors, (131), 18 states have call predecessors, (131), 18 states have return successors, (139), 131 states have call predecessors, (139), 131 states have call successors, (139) [2024-11-11 21:52:41,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 650 transitions. [2024-11-11 21:52:41,005 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 650 transitions. Word has length 113 [2024-11-11 21:52:41,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:52:41,006 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 650 transitions. [2024-11-11 21:52:41,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-11 21:52:41,006 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 650 transitions. [2024-11-11 21:52:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-11 21:52:41,010 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:52:41,011 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:52:41,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:52:41,211 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-11-11 21:52:41,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:52:41,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:52:41,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1639487556, now seen corresponding path program 1 times [2024-11-11 21:52:41,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:52:41,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750308308] [2024-11-11 21:52:41,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:41,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:52:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 21:52:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:52:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:52:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 21:52:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:52:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:52:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 21:52:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:52:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 21:52:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 21:52:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 21:52:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 21:52:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 21:52:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-11 21:52:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 21:52:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-11 21:52:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-11 21:52:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-11 21:52:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-11 21:52:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-11 21:52:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-11 21:52:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-11 21:52:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2024-11-11 21:52:41,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:52:41,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750308308] [2024-11-11 21:52:41,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750308308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:52:41,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825475927] [2024-11-11 21:52:41,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:41,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:52:41,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:52:41,850 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-11-11 21:52:41,852 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-11-11 21:52:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:42,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 21:52:42,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:52:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2024-11-11 21:52:42,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:52:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2024-11-11 21:52:42,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825475927] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:52:42,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:52:42,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 13 [2024-11-11 21:52:42,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860257606] [2024-11-11 21:52:42,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:52:42,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 21:52:42,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:52:42,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 21:52:42,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:52:42,633 INFO L87 Difference]: Start difference. First operand 404 states and 650 transitions. Second operand has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 9 states have internal predecessors, (114), 2 states have call successors, (54), 6 states have call predecessors, (54), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-11 21:52:46,823 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-11-11 21:52:50,968 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-11-11 21:52:51,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:52:51,722 INFO L93 Difference]: Finished difference Result 840 states and 1344 transitions. [2024-11-11 21:52:51,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 21:52:51,722 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 9 states have internal predecessors, (114), 2 states have call successors, (54), 6 states have call predecessors, (54), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 192 [2024-11-11 21:52:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:52:51,728 INFO L225 Difference]: With dead ends: 840 [2024-11-11 21:52:51,728 INFO L226 Difference]: Without dead ends: 439 [2024-11-11 21:52:51,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 434 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2024-11-11 21:52:51,732 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 110 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 241 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:52:51,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1405 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 547 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-11-11 21:52:51,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-11 21:52:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 433. [2024-11-11 21:52:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 281 states have (on average 1.4555160142348755) internal successors, (409), 287 states have internal predecessors, (409), 131 states have call successors, (131), 18 states have call predecessors, (131), 20 states have return successors, (143), 131 states have call predecessors, (143), 131 states have call successors, (143) [2024-11-11 21:52:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 683 transitions. [2024-11-11 21:52:51,813 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 683 transitions. Word has length 192 [2024-11-11 21:52:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:52:51,813 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 683 transitions. [2024-11-11 21:52:51,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 9 states have internal predecessors, (114), 2 states have call successors, (54), 6 states have call predecessors, (54), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-11 21:52:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 683 transitions. [2024-11-11 21:52:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-11 21:52:51,818 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:52:51,818 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 10, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:52:51,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 21:52:52,018 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-11-11 21:52:52,019 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:52:52,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:52:52,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1075591815, now seen corresponding path program 2 times [2024-11-11 21:52:52,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:52:52,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556735099] [2024-11-11 21:52:52,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:52,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:52:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:52,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:52:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:52:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:52:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 21:52:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:52:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:52:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 21:52:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:52:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 21:52:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-11 21:52:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:52:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-11 21:52:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-11 21:52:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-11 21:52:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-11 21:52:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-11 21:52:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-11 21:52:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-11 21:52:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-11 21:52:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:52:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-11 21:52:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-11 21:52:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2024-11-11 21:52:53,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:52:53,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556735099] [2024-11-11 21:52:53,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556735099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:52:53,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:52:53,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:52:53,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464299757] [2024-11-11 21:52:53,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:52:53,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:52:53,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:52:53,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:52:53,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:52:53,181 INFO L87 Difference]: Start difference. First operand 433 states and 683 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-11 21:52:55,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:52:59,341 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-11-11 21:53:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:53:01,854 INFO L93 Difference]: Finished difference Result 880 states and 1410 transitions. [2024-11-11 21:53:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 21:53:01,854 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 217 [2024-11-11 21:53:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:53:01,865 INFO L225 Difference]: With dead ends: 880 [2024-11-11 21:53:01,865 INFO L226 Difference]: Without dead ends: 842 [2024-11-11 21:53:01,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:53:01,867 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 441 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 186 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:53:01,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1486 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1056 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2024-11-11 21:53:01,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-11-11 21:53:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 823. [2024-11-11 21:53:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 518 states have (on average 1.4826254826254825) internal successors, (768), 533 states have internal predecessors, (768), 261 states have call successors, (261), 36 states have call predecessors, (261), 43 states have return successors, (301), 261 states have call predecessors, (301), 261 states have call successors, (301) [2024-11-11 21:53:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1330 transitions. [2024-11-11 21:53:01,974 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1330 transitions. Word has length 217 [2024-11-11 21:53:01,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:53:01,975 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1330 transitions. [2024-11-11 21:53:01,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-11 21:53:01,975 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1330 transitions. [2024-11-11 21:53:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-11 21:53:01,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:53:01,986 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 10, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:53:01,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:53:01,987 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:53:01,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:53:01,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1166529487, now seen corresponding path program 1 times [2024-11-11 21:53:01,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:53:01,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158185449] [2024-11-11 21:53:01,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:53:01,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:53:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:02,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:53:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:02,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:53:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:02,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:02,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:53:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:02,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:02,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 21:53:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:53:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:53:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 21:53:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:53:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 21:53:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-11 21:53:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:53:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-11 21:53:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-11 21:53:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-11 21:53:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-11 21:53:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-11 21:53:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-11 21:53:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-11 21:53:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-11 21:53:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:53:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-11 21:53:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-11 21:53:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:03,117 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2024-11-11 21:53:03,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:53:03,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158185449] [2024-11-11 21:53:03,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158185449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:53:03,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:53:03,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:53:03,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170480889] [2024-11-11 21:53:03,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:53:03,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:53:03,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:53:03,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:53:03,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:53:03,121 INFO L87 Difference]: Start difference. First operand 823 states and 1330 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-11 21:53:07,434 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-11-11 21:53:11,445 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-11-11 21:53:12,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:53:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:53:14,601 INFO L93 Difference]: Finished difference Result 1597 states and 2584 transitions. [2024-11-11 21:53:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 21:53:14,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 217 [2024-11-11 21:53:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:53:14,612 INFO L225 Difference]: With dead ends: 1597 [2024-11-11 21:53:14,612 INFO L226 Difference]: Without dead ends: 822 [2024-11-11 21:53:14,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:53:14,620 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 495 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 426 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:53:14,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1534 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 1003 Invalid, 2 Unknown, 0 Unchecked, 10.9s Time] [2024-11-11 21:53:14,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-11-11 21:53:14,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 806. [2024-11-11 21:53:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 509 states have (on average 1.475442043222004) internal successors, (751), 524 states have internal predecessors, (751), 253 states have call successors, (253), 35 states have call predecessors, (253), 43 states have return successors, (286), 254 states have call predecessors, (286), 253 states have call successors, (286) [2024-11-11 21:53:14,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1290 transitions. [2024-11-11 21:53:14,688 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1290 transitions. Word has length 217 [2024-11-11 21:53:14,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:53:14,689 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1290 transitions. [2024-11-11 21:53:14,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-11 21:53:14,690 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1290 transitions. [2024-11-11 21:53:14,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-11 21:53:14,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:53:14,696 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 10, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:53:14,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:53:14,697 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:53:14,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:53:14,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1021991451, now seen corresponding path program 1 times [2024-11-11 21:53:14,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:53:14,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131329266] [2024-11-11 21:53:14,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:53:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:53:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 21:53:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:53:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:53:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 21:53:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:53:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:53:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 21:53:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:53:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 21:53:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-11 21:53:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:53:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-11 21:53:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-11 21:53:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-11 21:53:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-11 21:53:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-11 21:53:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-11 21:53:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-11 21:53:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-11 21:53:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:53:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-11 21:53:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-11 21:53:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2024-11-11 21:53:15,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:53:15,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131329266] [2024-11-11 21:53:15,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131329266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:53:15,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:53:15,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:53:15,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272379324] [2024-11-11 21:53:15,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:53:15,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:53:15,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:53:15,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:53:15,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:53:15,769 INFO L87 Difference]: Start difference. First operand 806 states and 1290 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-11 21:53:19,792 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-11-11 21:53:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:53:21,964 INFO L93 Difference]: Finished difference Result 1277 states and 2017 transitions. [2024-11-11 21:53:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:53:21,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 217 [2024-11-11 21:53:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:53:21,971 INFO L225 Difference]: With dead ends: 1277 [2024-11-11 21:53:21,971 INFO L226 Difference]: Without dead ends: 736 [2024-11-11 21:53:21,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:53:21,976 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 479 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 410 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:53:21,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1571 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 1040 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2024-11-11 21:53:21,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-11 21:53:22,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 714. [2024-11-11 21:53:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 456 states have (on average 1.4429824561403508) internal successors, (658), 469 states have internal predecessors, (658), 214 states have call successors, (214), 35 states have call predecessors, (214), 43 states have return successors, (244), 215 states have call predecessors, (244), 214 states have call successors, (244) [2024-11-11 21:53:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1116 transitions. [2024-11-11 21:53:22,037 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1116 transitions. Word has length 217 [2024-11-11 21:53:22,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:53:22,037 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 1116 transitions. [2024-11-11 21:53:22,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-11 21:53:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1116 transitions. [2024-11-11 21:53:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-11 21:53:22,044 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:53:22,044 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 10, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:53:22,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:53:22,044 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:53:22,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:53:22,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1844674288, now seen corresponding path program 1 times [2024-11-11 21:53:22,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:53:22,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361454645] [2024-11-11 21:53:22,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:53:22,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:53:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:22,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 21:53:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:22,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:53:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:22,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:22,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:53:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:22,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:22,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:53:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:22,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 21:53:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 21:53:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 21:53:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:53:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 21:53:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-11 21:53:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 21:53:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-11 21:53:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 21:53:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-11 21:53:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-11 21:53:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-11 21:53:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-11 21:53:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-11 21:53:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-11 21:53:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-11 21:53:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:53:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-11 21:53:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-11 21:53:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2024-11-11 21:53:23,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:53:23,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361454645] [2024-11-11 21:53:23,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361454645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:53:23,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003850413] [2024-11-11 21:53:23,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:53:23,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:53:23,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:53:23,177 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-11-11 21:53:23,179 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-11-11 21:53:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:23,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 1673 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 21:53:23,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:53:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 280 proven. 4 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-11 21:53:23,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:53:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2024-11-11 21:53:24,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003850413] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:53:24,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:53:24,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 16 [2024-11-11 21:53:24,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105292099] [2024-11-11 21:53:24,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:53:24,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 21:53:24,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:53:24,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 21:53:24,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:53:24,374 INFO L87 Difference]: Start difference. First operand 714 states and 1116 transitions. Second operand has 16 states, 16 states have (on average 6.0625) internal successors, (97), 12 states have internal predecessors, (97), 9 states have call successors, (51), 8 states have call predecessors, (51), 7 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2024-11-11 21:53:28,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:53:28,409 INFO L93 Difference]: Finished difference Result 1786 states and 2828 transitions. [2024-11-11 21:53:28,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 21:53:28,410 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 12 states have internal predecessors, (97), 9 states have call successors, (51), 8 states have call predecessors, (51), 7 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) Word has length 221 [2024-11-11 21:53:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:53:28,419 INFO L225 Difference]: With dead ends: 1786 [2024-11-11 21:53:28,419 INFO L226 Difference]: Without dead ends: 1120 [2024-11-11 21:53:28,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:53:28,424 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 879 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 841 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 2531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 841 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:53:28,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1553 Invalid, 2531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [841 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-11 21:53:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2024-11-11 21:53:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1083. [2024-11-11 21:53:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 681 states have (on average 1.449339207048458) internal successors, (987), 701 states have internal predecessors, (987), 335 states have call successors, (335), 57 states have call predecessors, (335), 66 states have return successors, (382), 334 states have call predecessors, (382), 335 states have call successors, (382) [2024-11-11 21:53:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1704 transitions. [2024-11-11 21:53:28,563 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1704 transitions. Word has length 221 [2024-11-11 21:53:28,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:53:28,564 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1704 transitions. [2024-11-11 21:53:28,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 12 states have internal predecessors, (97), 9 states have call successors, (51), 8 states have call predecessors, (51), 7 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2024-11-11 21:53:28,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1704 transitions. [2024-11-11 21:53:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-11 21:53:28,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:53:28,575 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 10, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:53:28,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 21:53:28,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:53:28,780 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:53:28,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:53:28,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1314677552, now seen corresponding path program 1 times [2024-11-11 21:53:28,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:53:28,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302546469] [2024-11-11 21:53:28,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:53:28,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:53:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:30,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 21:53:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:53:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:53:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:53:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 21:53:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 21:53:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 21:53:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:53:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 21:53:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:53:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-11 21:53:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 21:53:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-11 21:53:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 21:53:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-11 21:53:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-11 21:53:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-11 21:53:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-11 21:53:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-11 21:53:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-11 21:53:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-11 21:53:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:53:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-11 21:53:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-11 21:53:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2024-11-11 21:53:31,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:53:31,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302546469] [2024-11-11 21:53:31,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302546469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:53:31,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785905354] [2024-11-11 21:53:31,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:53:31,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:53:31,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:53:31,781 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-11-11 21:53:31,782 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-11-11 21:53:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:53:32,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 1771 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-11 21:53:32,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:53:32,752 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-11-11 21:53:39,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 21:53:39,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 21:53:39,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2024-11-11 21:53:39,765 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2024-11-11 21:53:39,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104